Book Chapter
Space complexity: the classes L, FL, NL and PSPACE
Richard Lassaigne and Michel de Rougemont
Discrete Mathematics and Theoretical Computer Science, 2004, Logic and Complexity, Part 2, Pages 229-250
Book Chapter
Classes beyond NP
Richard Lassaigne and Michel de Rougemont
Discrete Mathematics and Theoretical Computer Science, 2004, Logic and Complexity, Part 3, Pages 323-342
Book Chapter
CONS-free programs with tree input
Extended abstract
Amir M. Ben-Amram and Holger Petersen
Lecture Notes in Computer Science, 1998, Volume 1443, Automata, Languages and Programming, Pages 271-282
Book Chapter
Subrecursion as a basis for a feasible programming language
Paul J. Voda
Lecture Notes in Computer Science, 1995, Volume 933, Computer Science Logic, Pages 324-338
Book Chapter
On functions computable in nondeterministic polynomial time: Some characterizations
Dieter Spreen
Lecture Notes in Computer Science, 1988, Volume 329, CSL '87, Pages 289-303
Book Chapter
Investigating programs in terms of partial graphs
Extended abstract
Gunther Schmidt
Lecture Notes in Computer Science, 1981, Volume 100, Graphtheoretic Concepts in Computer Science, Pages 268-269
Book Chapter
Structure and importance of logspace-MOD-classes
Gerhard Buntrock, Ulrich Hertrampf, Carsten Damm and Christoph Meinel
Lecture Notes in Computer Science, 1991, Volume 480, STACS 91, Pages 360-371
Book Chapter
Quantifiers and Logical Reductions
Springer Monographs in Mathematics, 2006, Finite Model Theory, Pages 307-338
Book Chapter
Relativizing Small Complexity Classes and Their Theories
Klaus Aehlig, Stephen Cook and Phuong Nguyen
Lecture Notes in Computer Science, 2007, Volume 4646, Computer Science Logic, Pages 374-388
Book Chapter
Proofs as Efficient Programs
Ugo Dal Lago and Simone Martini
2008, Deduction, Computation, Experiment, Pages 141-157