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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2015
2015
We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from multi-dimensional mean-payoff to energy… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Scheduling analysis in real-time systems require an off-line feasibility (schedulability) test to guarantee the response time of… (More)
  • figure 2
  • figure 3
  • table 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Developing a polynomial time algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We study a general class of bicriteria network design proble ms. A generic problem in this class is as follows: Given an… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In this paper, we consider the preemptive scheduling of hard-real-time sporadic task systems on one processor. We rst give… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
This paper describes practical optimization/ approximation algorithms for scheduling a set of partially ordered computational… (More)
  • table I
  • figure 1
  • figure 2
  • table II
  • table III
Is this relevant?