default search action
Information and Computation, Volume 125
Volume 125, Number 1, 25 February 1996
- Nadia Creignou, Miki Hermann:
Complexity of Generalized Satisfiability Counting Problems. 1-12 - David W. Juedes
, Jack H. Lutz:
Completeness and Weak Completeness Under Polynomial-Size Circuits. 13-31 - Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas:
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. 32-45 - Yves Lafont, Andre Scedrov
The Undecidability of Second Order Multiplicative Linear Logic. 46-51 - Judit Bar-Ilan
Scheduling Jobs Using Common Resources. 52-61 - Orna Kupferman, Orna Grumberg:
Branching-Time Temporal Logic and Tree Automata. 62-69 - Ronald V. Book, Osamu Watanabe:
On Random Hard Sets for NP. 70-76
Volume 125, Number 2, 15 March 1996
- Masami Hagiya:
Preface. 77 - Martín Abadi, Luca Cardelli
A Theory of Primitive Objects: Untyped and First-Order Systems. 78-102 - Franco Barbanera, Stefano Berardi:
A Symmetric Lambda Calculus for Classical Program Extraction. 103-117 - Ursula Goltz, Roberto Gorrieri, Arend Rensink:
Comparing Syntactic and Semantic Sction Refinement. 118-143 - Masako Takahashi, Yohji Akama
Normal Proofs and Their Grammar. 144-153 - David A. Plaisted, Andrea Sattler-Klein:
Proof Lengths for Equational Completion. 154-170
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-23 19:19 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: