Result 1 to 20 of 107 total
Propositional proofs and reductions between NP search problems. (English)
Ann. Pure Appl. Logic 163, No. 9, 1163-1182 (2012).
1
Sharpened lower bounds for cut elimination. (English)
J. Symb. Log. 77, No. 2, 656-668 (2012).
2
Towards NP-P via proof complexity and search. (English)
Ann. Pure Appl. Logic 163, No. 7, 906-917 (2012).
3
Lower complexity bounds in justification logic. (English)
Ann. Pure Appl. Logic 163, No. 7, 888-905 (2012).
4
Special issue: Computability in Europe 2009. Selected papers based on the presentations at the 5th conference on computability in Europe, CiE 2009: Mathematical theory and computational practice, Heidelberg, Germany, July 19‒24, 2009. (English)
Ann. Pure Appl. Logic 163, No. 5, 483-619 (2012).
5
Strong isomorphism reductions in complexity theory. (English)
J. Symb. Log. 76, No. 4, 1381-1402 (2011).
6
Corrected upper bounds for free-cut elimination. (English)
Theor. Comput. Sci. 412, No. 39, 5433-5445 (2011).
7
Limits on alternation-trading proofs for time-space lower bounds. (English)
Electron. Colloq. Comput. Complex. 18, 31 (2011).
8
Strong isomorphism reductions in complexity theory (English)
J. Symb. Log. 76, No. 4, 1381-1402 (2011).
9
Characterising definable search problems in bounded arithmetic via proof notations. (English)
Schindler, Ralf (ed.), Ways of proof theory. Collected papers by speakers of the colloquium and workshop held on the occasion of the retirement of Wolfram Pohlers, July 17‒19, 2008, Münster, Germany. Frankfurt am Main: Ontos Verlag (ISBN 978-3-86838-087-3/hbk). Ontos Mathematical Logic 2, 65-133 (2010).
10
The quantifier complexity of polynomial-size iterated definitions in first-order logic. (English)
Math. Log. Q. 56, No. 6, 573-590 (2010).
11
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. (English)
J. Math. Log. 9, No. 1, 103-138 (2009).
12
Pool resolution is NP-hard to recognize. (English)
Arch. Math. Logic 48, No. 8, 793-798 (2009).
13
Special issue: Selected papers based on the conference CiE 2007: Computation and logic in the real world, Siena, Italy, June 18‒23, 2007. (English)
Ann. Pure Appl. Logic 160, No. 3, 229-418 (2009).
14
The NP-completeness of reflected fragments of justification logics. (English)
Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3‒6, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-92686-3/pbk). Lecture Notes in Computer Science 5407, 122-136 (2009).
15
The NP-completeness of reflected fragments of justification logics (English)
LFCS, 122-136 (2009).
16
Efficient large-scale sweep and prune methods with AABB insertion and removal (English)
VR, 191-198 (2009).
17
Resolution trees with lemmas: resolution refinements that characterize DLL algorithms with clause learning. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 13, 28 p., electronic only (2008).
18
Resolution trees with lemmas: Resolution refinements that characterize DLL algorithms with clause learning. (English)
Comput. Res. Repos. 2008, Article No. 0811.1075 (2008).
19
The NP-hardness of finding a directed acyclic graph for regular resolution. (English)
Theor. Comput. Sci. 396, No. 1-3, 271-276 (2008).
20
Result 1 to 20 of 107 total
Start
Contact
Print
General Help
