On the public citation graph

Some connections between presentability of complexity classes and the power of formal systems of reasoning

https://doi.org/10.1007/bfb0030318
0 signed · 32 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/bfb0012797openalex-snapshot
On relativization and the existence of complete sets
inferredcites →https://doi.org/10.1016/0304-3975(79)90047-1openalex-snapshot
Relations between diagonalization, proof systems, and complexity gaps
inferredcites →https://doi.org/10.1016/0304-3975(81)90069-4openalex-snapshot
On the structure of sets in NP and other complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(82)90114-1openalex-snapshot
A uniform approach to obtain diagonal sets in complexity classes
inferredcites →https://doi.org/10.1145/1008335.1008336openalex-snapshot
Independence results in computer science

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19910370702openalex-snapshot
Effectivizing Inseparability
inferred← citeshttps://doi.org/10.1002/malq.201010021openalex-snapshot
Do there exist complete sets for promise classes?
inferred← citeshttps://doi.org/10.1006/inco.1995.1119openalex-snapshot
Defying Upward and Downward Separation
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_106openalex-snapshot
The topology of provability in complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_63openalex-snapshot
Containment, separation, complete sets, and immunity of complexity classes
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-56503-5_21openalex-snapshot
Defying upward and downward separation
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_7openalex-snapshot
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_11openalex-snapshot
On Complete Problems, Relativizations and Logics for Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_17openalex-snapshot
A Parameterized Halting Problem
inferred← citeshttps://doi.org/10.1007/bfb0015750openalex-snapshot
On complete problems for NP∩CoNP
inferred← citeshttps://doi.org/10.1007/bfb0017131openalex-snapshot
Structure of complexity classes: Separations, collapses, and completeness
inferred← citeshttps://doi.org/10.1007/bfb0023471openalex-snapshot
An unambiguous class possessing a complete set
inferred← citeshttps://doi.org/10.1007/bfb0030285openalex-snapshot
Mathematical Foundations of Computer Science 1984
inferred← citeshttps://doi.org/10.1007/bfb0036203openalex-snapshot
On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90026-2openalex-snapshot
Independence results about context-free languages and lower bounds
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90036-0openalex-snapshot
The topology of provability in complexity theory
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90022-9openalex-snapshot
Complexity classes without machines: On complete languages for UP
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00111-7openalex-snapshot
A characterization of the leaf language classes
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.1109/lics.2011.17openalex-snapshot
Listings and Logics
inferred← citeshttps://doi.org/10.1109/sct.1994.315800openalex-snapshot
Predicate classes and promise classes
inferred← citeshttps://doi.org/10.1145/2339123.2339124openalex-snapshot
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
inferred← citeshttps://doi.org/10.1145/2696081.2696095openalex-snapshot
Disjoint NP-Pairs and Propositional Proof Systems
inferred← citeshttps://doi.org/10.2178/jsl/1318338855openalex-snapshot
Strong isomorphism reductions in complexity theory
inferred← citeshttps://doi.org/10.3233/fun-2007-791-208openalex-snapshot
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
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.