On the public citation graph

On complete problems for NP∩CoNP

https://doi.org/10.1007/bfb0015750
0 signed · 30 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.1007/bfb0030318openalex-snapshot
Some connections between presentability of complexity classes and the power of formal systems of reasoning
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

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.19900360302openalex-snapshot
Relativized Gödel speed‐up and the degree of succinctness of representations
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_93openalex-snapshot
The boolean hierarchy: Hardware over NP
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_62openalex-snapshot
Complexity classes without machines: On complete languages for UP
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-18740-5_41openalex-snapshot
Some observations about NP complete sets
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_13openalex-snapshot
The Complexity of Finding Top-Toda-Equivalence-Class Members
inferred← citeshttps://doi.org/10.1007/978-981-96-3870-3_2openalex-snapshot
Graphs and Computational Complexity
inferred← citeshttps://doi.org/10.1007/bfb0017131openalex-snapshot
Structure of complexity classes: Separations, collapses, and completeness
inferred← citeshttps://doi.org/10.1007/bfb0023873openalex-snapshot
Banishing robust Turing completeness
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.1007/s00224-005-1211-9openalex-snapshot
The Complexity of Finding Top-Toda-Equivalence-Class Members
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90078-5openalex-snapshot
A note on complete problems for complexity classes
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90038-mopenalex-snapshot
On the complexity of ranking
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90040-copenalex-snapshot
Relativized counting classes: Relations among thresholds, parity, and mods
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/0304-3975(89)90164-3openalex-snapshot
Relativizing relativized computations
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90318-aopenalex-snapshot
Separating complexity classes with tally oracles
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00161-1openalex-snapshot
A general method to construct oracles realizing given relationships between complexity classes
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/j.ic.2005.01.002openalex-snapshot
Competing provers yield improved Karp–Lipton collapse results
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.1109/sct.1990.113976openalex-snapshot
A note on relativizing complexity classes with tally
inferred← citeshttps://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferred← citeshttps://doi.org/10.1145/3564246.3585119openalex-snapshot
Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness
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.