73 search results - page 4 / 15 » On the Automatizability of Polynomial Calculus |
LICS
2008
IEEE
15 years 3 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...
STOC
1999
ACM
15 years 1 months ago
1999
ACM
ECCC
2007
14 years 9 months ago
2007
83
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...