Skip to search formSkip to main contentSkip to account menu

Pseudo-polynomial time

Known as: Pseudo-polynomial-time, Pseudopolynomial, Pseudopolynomial time 
In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is polynomial in the numeric value of the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AKS primality testComputational complexity theoryDynamic programmingK shortest path routing

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Combining Pseudo-median filter and median filter to improve performance
Despite many of the same properties between standard median filter (SM) and Pseudo-median filter (PM), SM can remove impulses… 
Highly Cited
2009
Highly Cited
2009
Scalable video multicast in multi-carrier wireless data systems
Future 4G cellular networks are featured with high data rate and improved coverage, which will enable realtime video multicast… 
Highly Cited
2005
Highly Cited
2005
Optimal skewed data allocation on multiple channels with flat broadcast per channel
Broadcast is an efficient and scalable way of transmitting data to an unlimited number of clients that are listening to a channel… 
2004
2004
Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy
In the paper, we analyze different solution methods for the two-machine flow shop scheduling problem with a common due date with… 
2003
2003
Scheduling Parallel Dedicated Machines with the Speeding Up Resource
Highly Cited
1997
Highly Cited
1997
An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems
The paper addresses the problem of jointly scheduling tasks with both hard and soft real time constraints. We present a new… 
1997
1997
Theory and algorithms for state minimization of nondeterministic FSMs
This paper addresses state minimization problems of different classes of nondeterministic finite-state machines (NDFSMs). We… 
1992
1992
Negative circuits for flows and submodular flows
1990
1990
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor
We investigate the preemptive scheduling of periodic, real-time task systems on one processor. We present three major results… 
1989
1989
Minimizing Mean Flow Time with Error Constraint
Abstract. We consider the problem of minimizing mean flow time for the Imprecise Computation Model introduced by Lin et al. A… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)