On the public citation graph
CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS
0 signed · 42 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1998.1575openalex-snapshot
The Relative Complexity of NP Search Problems
inferredcites →https://doi.org/10.1007/11780342_29openalex-snapshot
Forcing with Random Variables and Proof Complexity
inferredcites →https://doi.org/10.1016/0168-0072(90)90023-uopenalex-snapshot
Exponentiation and second-order bounded arithmetic
inferredcites →https://doi.org/10.1016/j.apal.2010.12.002openalex-snapshot
The provably total NP search problems of weak second order bounded arithmetic
inferredcites →https://doi.org/10.1016/s0022-0000(05)80063-7openalex-snapshot
On the complexity of the parity argument and other inefficient proofs of existence
inferredcites →https://doi.org/10.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1017/cbo9780511676277openalex-snapshot
Logical Foundations of Proof Complexity
inferredcites →https://doi.org/10.1017/cbo9781139107211openalex-snapshot
Forcing with Random Variables and Proof Complexity
inferredcites →https://doi.org/10.1145/3060145openalex-snapshot
The NP Search Problems of Frege and Extended Frege Proofs
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.2178/jsl/1120224731openalex-snapshot
Structured pigeonhole principle, search problems and hard tautologies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.12.003openalex-snapshot
Towards a unified complexity theory of total functions
inferred← citeshttps://doi.org/10.1017/9781108242066.006openalex-snapshot
Quantified Propositional Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.008openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.010openalex-snapshot
Basic Example of the Correspondence between Theories and Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.011openalex-snapshot
The Two Worlds of Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/9781108242066.012openalex-snapshot
Up to EF via the 〈. . .〉 Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.013openalex-snapshot
Examples of Upper Bounds and p-Simulations
inferred← citeshttps://doi.org/10.1017/9781108242066.014openalex-snapshot
Beyond EF via the || . . . || Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.016openalex-snapshot
LKd+1/2 and Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.017openalex-snapshot
Fd and Logical Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.018openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.019openalex-snapshot
Feasible Interpolation: A Framework
inferred← citeshttps://doi.org/10.1017/9781108242066.020openalex-snapshot
Feasible Interpolation: Applications
inferred← citeshttps://doi.org/10.1017/9781108242066.022openalex-snapshot
Model Theory and Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781108242066.024openalex-snapshot
The Nature of Proof Complexity
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00044openalex-snapshot
Jump Operators, Interactive Proofs and Proof Complexity Generators
inferred← citeshttps://doi.org/10.1145/3060145openalex-snapshot
The NP Search Problems of Frege and Extended Frege Proofs
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.