default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLCC 1994: Indianapolis, Indiana, USA
- Daniel Leivant:
Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, International Workshop LCC '94, Indianapolis, Indiana, USA, 13-16 October 1994. Lecture Notes in Computer Science 960, Springer 1995, ISBN 3-540-60178-3 - Felice Cardone:
Strict Finitism and Feasibility. 1-21 - Rohit Parikh:
Logical Omniscience. 22-29 - Vladimir Yu. Sazonov:
On Feasible Numbers. 30-51 - Stephen A. Bloch:
On Parallel Hierarchies and R_k^i. 52-76 - Ulrich Berger
, Helmut Schwichtenberg:
Program Extraction from Classical Proofs. 77-97 - Peter Clote:
Computational Models and Function Algebras. 98-130 - Robert L. Constable:
Expressing Computational Complexity in Constructive Type Theory. 131-144 - Jean-Yves Girard:
Light Linear Logic. 145-176 - Daniel Leivant:
Intrinsic Theories and Computational Complexity. 177-194 - Samuel R. Buss:
On Herbrand's Theorem. 195-209 - Jan Krajícek, Pavel Pudlák:
Some Consequences of Cryptographical Conjectures for S_2^1 and EF. 210-220 - Gaisi Takeuti:
Frege Proof System and TNC°. 221-252 - Stephen J. Bellantoni:
Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length. 253-268 - Anil Seth:
Type 2 Polynomial Hierarchies. 269-280 - Stanley S. Wainer:
The Hierarchy of terminating Recursive Programs over N. 281-299 - Douglas A. Cenzer, Jeffrey B. Remmel:
Feasibly Categorial Models. 300-312 - Erich Grädel, Yuri Gurevich:
Metafinite Model Theory. 313-366 - Bakhadyr Khoussainov, Anil Nerode:
Automatic Presentations of Structures. 367-392 - Anuj Dawar:
A Restricted Second Order Logic for Finite Structures. 393-413 - Ronald Fagin:
Comparing the Power of Monadic NP Games. 414-425 - Stéphane Grumbach, Jianwen Su, Christophe Tollu:
Linear Constraint Query Languages: Expressive Power and Complexity. 426-446 - Steven Lindell:
A Constant-Space Sequential Model of Computation for First-Order Logic. 447-462 - Johann A. Makowsky, Y. B. Pnueli:
Logics Capturing Relativized Complexity Classes Uniformly. 463-479 - Eric Rosen, Scott Weinstein:
Preservation Theorems in Finite Model Theory. 480-502 - Dan Suciu, Val Tannen:
A Query Language for NC. 503-514
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-22 19:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
