On the public citation graph
The NP Search Problems of Frege and Extended Frege Proofs
0 signed · 61 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.1002/malq.200610019openalex-snapshot
The strength of sharply bounded induction
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.1007/978-3-642-58622-4_5openalex-snapshot
Propositional Proof Complexity an Introduction
inferredcites →https://doi.org/10.1007/bfb0075316openalex-snapshot
Counting problems in bounded arithmetic
inferredcites →https://doi.org/10.1007/s00153-005-0282-2openalex-snapshot
Quantified propositional calculus and a second-order theory for NC1
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/j.apal.2003.12.003openalex-snapshot
Dual weak pigeonhole principle, Boolean complexity, and derandomization
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/j.apal.2011.06.014openalex-snapshot
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic
inferredcites →https://doi.org/10.1016/j.jcss.2017.12.003openalex-snapshot
Towards a unified complexity theory of total functions
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.1016/s0049-237x(98)80016-5openalex-snapshot
An Introduction to Proof Theory
inferredcites →https://doi.org/10.1016/s0168-0072(99)00041-xopenalex-snapshot
A bounded arithmetic AID for Frege systems
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/fms.2016.13openalex-snapshot
CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS
inferredcites →https://doi.org/10.1109/fscs.1990.89602openalex-snapshot
On graph-theoretic lemmata and complexity classes
inferredcites →https://doi.org/10.1112/plms/pdq044openalex-snapshot
The provably total search problems of bounded arithmetic
inferredcites →https://doi.org/10.1112/plms/s3-69.1.1openalex-snapshot
An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
inferredcites →https://doi.org/10.1137/0221046openalex-snapshot
An Optimal Parallel Algorithm for Formula Evaluation
inferredcites →https://doi.org/10.1145/2559950openalex-snapshot
Improved witnessing and local improvement principles for second-order bounded arithmetic
inferredcites →https://doi.org/10.1145/28395.28409openalex-snapshot
The Boolean formula value problem is in ALOGTIME
inferredcites →https://doi.org/10.1145/800116.803756openalex-snapshot
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
inferredcites →https://doi.org/10.2178/jsl/1185803628openalex-snapshot
NP search problems in low fragments of bounded arithmetic
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_24openalex-snapshot
Mining the Surface: Witnessing the Low Complexity Theorems of Arithmetic
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.1017/fms.2016.13openalex-snapshot
CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS
inferred← citeshttps://doi.org/10.1017/s0960129524000185openalex-snapshot
Witnessing flows in arithmetic
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00044openalex-snapshot
Jump Operators, Interactive Proofs and Proof Complexity Generators
inferred← citeshttps://doi.org/10.4230/lipics.csl.2020.12openalex-snapshot
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
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.