2446 search results - page 28 / 490 » Choiceless Polynomial Time |
COCO
2008
Springer
13 years 9 months ago
2008
Springer
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant
RECOMB
2007
Springer
14 years 7 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
ESOP
2010
Springer
14 years 2 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
SBIA
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
GLVLSI
2003
IEEE
14 years 25 days ago
2003
IEEE
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...