73 search results - page 5 / 15 » The Strength of Multilinear Proofs |
129
click to vote
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
CP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
101
click to vote
JCM
2008
14 years 9 months ago
2008
In a large-scale sensor network individual sensors can be compromised to inject bogus sensing reports. While SEF can filter out the outfield false reports, it is incapable of detec...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
57
Voted
MLQ
2006
14 years 9 months ago
2006
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...