1226 search results - page 1 / 246 » Proofs, Programs and Abstract Complexity |
198
Voted
CSL
2007
Springer
15 years 11 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 ï...
158
click to vote
TCS
2011
15 years 9 days ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
195
Voted
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
155
Voted
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisï¬ability of CNF formulas under the promise that any satisï¬abl...