352 search results - page 3 / 71 » Proofs as Polynomials |
IPL
2006
13 years 6 months ago
2006
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All ...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
MST
2010
13 years 5 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
TCC
2005
Springer
14 years 5 days ago
2005
Springer
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
JCT
2000
13 years 6 months ago
2000
The Kostka numbers K