Search Sciweavers | Sciweavers

352 search results - page 3 / 71

» Proofs as Polynomials

click to vote

IPL
2006

104views more IPL 2006»

Optimal register allocation for SSA-form programs in polynomial time

14 years 11 months ago

Download www.cs.ucla.edu

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 ...

Sebastian Hack, Gerhard Goos

claim paper

Read More »

click to vote

LICS
2008
IEEE

116views Automated Reasoning» more LICS 2008»

On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity

15 years 6 months ago

Download www.eecs.qmul.ac.uk

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...

Søren Riis

claim paper

Read More »

101

click to vote

MST
2010

105views more MST 2010»

On the Automatizability of Polynomial Calculus

14 years 10 months ago

Download www.dsi.uniroma1.it

Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are ﬁxed parameter tractable by one-side error...

Nicola Galesi, Massimo Lauria

claim paper

Read More »

110

click to vote

TCC
2005
Springer

102views Cryptology» more TCC 2005»

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs

15 years 5 months ago

Download www.cs.umd.edu

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...

Jonathan Katz, Yehuda Lindell

claim paper

Read More »

click to vote

JCT
2000

75views more JCT 2000»

A Combinatorial Proof of a Recursion for the q-Kostka Polynomials

14 years 11 months ago