2446 search results - page 3 / 490 » Choiceless Polynomial Time |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
ESOP
2010
Springer
14 years 4 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. ...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...