On the public citation graph

Optimal proof systems for propositional logic and complete sets

https://doi.org/10.1007/bfb0028583
0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-79235-9openalex-snapshot
Structural Complexity I
inferredcites →https://doi.org/10.1007/bf02090768openalex-snapshot
On the power of parity polynomial time
inferredcites →https://doi.org/10.1007/bfb0079094openalex-snapshot
Lectures on proof theory
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
inferredcites →https://doi.org/10.1016/0020-0190(93)90102-fopenalex-snapshot
On random reductions from sparse sets to tally sets
inferredcites →https://doi.org/10.1016/0304-3975(84)90111-7openalex-snapshot
Computation times of NP sets of different densities
inferredcites →https://doi.org/10.1016/0304-3975(88)90022-9openalex-snapshot
Complexity classes without machines: On complete languages for UP
inferredcites →https://doi.org/10.1016/s0049-237x(08)70462-2openalex-snapshot
On the length of proofs of finitistic consistency statements in first order theories
inferredcites →https://doi.org/10.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1017/cbo9780511529948.003openalex-snapshot
Preliminaries
inferredcites →https://doi.org/10.1109/sfcs.1983.21openalex-snapshot
Generalized Kolmogorov complexity and the structure of feasible computations
inferredcites →https://doi.org/10.1142/s012905419300016xopenalex-snapshot
BANISHING ROBUST TURING COMPLETENESS
inferredcites →https://doi.org/10.1145/800141.804678openalex-snapshot
Some connections between nonuniform and uniform complexity classes
inferredcites →https://doi.org/10.2178/bsl/1203350879openalex-snapshot
The Complexity of Propositional Proofs
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.2307/2274765openalex-snapshot
Propositional proof systems, the consistency of first order theories and the complexity of computations
inferredcites →https://doi.org/10.2307/421131openalex-snapshot
The Complexity of Propositional Proofs
inferredcites →https://doi.org/10.7146/brics.v1i36.21607openalex-snapshot
On provably disjoint NP-pairs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10703163_13openalex-snapshot
On an Optimal Deterministic Algorithm for SAT
inferred← citeshttps://doi.org/10.1007/11685654_11openalex-snapshot
Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_29openalex-snapshot
Is the Standard Proof System for SAT P-Optimal?
inferred← citeshttps://doi.org/10.1007/3-540-45132-3_21openalex-snapshot
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_48openalex-snapshot
On the Structure of the Simulation Order of Proof Systems
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_34openalex-snapshot
Optimal Proof Systems and Sparse Sets
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_51openalex-snapshot
On Optimal Algorithms and Optimal Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_8openalex-snapshot
Hardness and Optimality in QBF Proof Systems Modulo NP
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_31openalex-snapshot
The Informational Content of Canonical Disjoint NP-Pairs
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_17openalex-snapshot
A Parameterized Halting Problem
inferred← citeshttps://doi.org/10.1007/978-94-017-2612-2_6openalex-snapshot
A Straightforward Proof of Köbler-Messner’s Result
inferred← citeshttps://doi.org/10.1007/bf02936099openalex-snapshot
Reduction of Hilbert-type proof systems to the if-then-else equational logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00155-4openalex-snapshot
On an optimal propositional proof system and the structure of easy subsets of TAUT
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00058-0openalex-snapshot
Optimal proof systems imply complete sets for promise classes
inferred← citeshttps://doi.org/10.1017/jsl.2021.99openalex-snapshot
NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN
inferred← citeshttps://doi.org/10.1109/ccc.1998.694599openalex-snapshot
Complete problems for promise classes by optimal proof systems for test sets
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214430openalex-snapshot
Disjoint NP-pairs
inferred← citeshttps://doi.org/10.1109/lics.2011.17openalex-snapshot
Listings and Logics
inferred← citeshttps://doi.org/10.1145/2339123.2339124openalex-snapshot
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.