Satisfiability, branch-width and Tseitin tautologies. (English)
Comput. Complexity 20, No. 4, 649-678 (2011).
1
Mean-payoff games and propositional proofs. (English)
Inf. Comput. 209, No. 4, 664-691 (2011).
2
Computability. Logic, reasoning, computer and Assembler, infinity, limits of automatizability. Textbook for class-room and self-study. (Berechenbarkeit. Logik, Argumentation, Rechner und Assembler, Unendlichkeit, Grenzen der Automatisierbarkeit. Lehrbuch für Unterricht und Selbststudium.) (German)
Studium. Wiesbaden: Vieweg+Teubner (ISBN 978-3-8348-1509-5/pbk). ii, 265~p. EUR~24.95 (2011).
3
On the automatizability of polynomial calculus. (English)
Theory Comput. Syst. 47, No. 2, 491-506 (2010).
4
Resolution is not automatizable unless W[P] is tractable. (English)
SIAM J. Comput. 38, No. 4, 1347-1363 (2008).
5
The complexity of properly learning simple concept classes. (English)
J. Comput. Syst. Sci. 74, No. 1, 16-34 (2008).
6
Non-automatizability of bounded-depth Frege proofs. (English)
Comput. Complexity 13, No. 1-2, 47-68 (2004).
7
On the automatizability of resolution and related propositional proof systems. (English)
Inf. Comput. 189, No. 2, 182-201 (2004).
8
Start
Contact
Print
General Help
