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.
2006
2006
On the solutions of the rational covariance extension problem corresponding to pseudopolynomials having boundary zeros
In this note, we study the rational covariance extension problem with degree bound when the chosen pseudopolynomial of degree at… 
2005
2005
Scheduling and lot streaming in two‐machine open shops with no‐wait in process
We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming… 
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… 
2003
2003
Cyclic Just-In-Time Sequences Are Optimal
Consider the Product Rate Variation problem. Given n products 1,...,i,...,n, and n positive integer demands d1,..., di,...,dn… 
2001
2001
Single-machine scheduling with a common due window
2000
2000
Multiprocessor task scheduling to minimize the maximum tardiness and the total completion time
We consider a scheduling problem with two parallel processors, where one task may need the processing of more than one processor… 
1997
1997
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
We study a problem in which a set of n jobs has to be batched as well as scheduled for processing on a single machine. A constant… 
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
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)