On the public citation graph
Parity Games and Propositional Proofs
0 signed · 69 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.1007/3-540-15648-8_7openalex-snapshot
Automata, tableaux, and temporal logics
inferredcites →https://doi.org/10.1007/3-540-36387-4openalex-snapshot
Automata logics, and infinite games: a guide to current research
inferredcites →https://doi.org/10.1007/978-1-4757-3550-5openalex-snapshot
Modal and Temporal Properties of Processes
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_51openalex-snapshot
Automatizability and Simple Stochastic Games
inferredcites →https://doi.org/10.1007/bf01768705openalex-snapshot
Positional strategies for mean payoff games
inferredcites →https://doi.org/10.1007/bfb0075316openalex-snapshot
Counting problems in bounded arithmetic
inferredcites →https://doi.org/10.1007/s00037-004-0183-5openalex-snapshot
Non-Automatizability of Bounded-Depth Frege Proofs
inferredcites →https://doi.org/10.1016/0304-3975(95)00188-3openalex-snapshot
The complexity of mean payoff games on graphs
inferredcites →https://doi.org/10.1016/0890-5401(92)90048-kopenalex-snapshot
The complexity of stochastic games
inferredcites →https://doi.org/10.1016/j.ic.2003.10.004openalex-snapshot
On the automatizability of resolution and related propositional proof systems
inferredcites →https://doi.org/10.1016/j.ic.2011.01.003openalex-snapshot
Mean-payoff games and propositional proofs
inferredcites →https://doi.org/10.1016/s0049-237x(98)80017-7openalex-snapshot
First-Order Proof Theory of Arithmetic
inferredcites →https://doi.org/10.1016/s0304-3975(02)00411-5openalex-snapshot
On reducibility and symmetry of disjoint NP pairs
inferredcites →https://doi.org/10.1017/jsl.2013.37openalex-snapshot
FRAGMENTS OF APPROXIMATE COUNTING
inferredcites →https://doi.org/10.1023/b:amai.0000012871.08577.0bopenalex-snapshot
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1051/ita/2011124openalex-snapshot
Recursive algorithm for parity games requires exponential time
inferredcites →https://doi.org/10.1090/dimacs/013/04openalex-snapshot
On algorithms for simple stochastic games
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/ccc.2004.30openalex-snapshot
Relativized NP search problems and propositional proof systems
inferredcites →https://doi.org/10.1109/sfcs.1991.185392openalex-snapshot
Tree automata, mu-calculus and determinacy
inferredcites →https://doi.org/10.1109/sfcs.2001.959895openalex-snapshot
Resolution is not automatizable unless W[P] is tractable
inferredcites →https://doi.org/10.1112/plms/pdq044openalex-snapshot
The provably total search problems of bounded arithmetic
inferredcites →https://doi.org/10.1137/06066850xopenalex-snapshot
Resolution Is Not Automatizable Unless W[P] Is Tractable
inferredcites →https://doi.org/10.1145/375827.375835openalex-snapshot
Short proofs are narrow—resolution made simple
inferredcites →https://doi.org/10.2168/lmcs-7(3:23)2011openalex-snapshot
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
inferredcites →https://doi.org/10.2178/jsl/1185803628openalex-snapshot
NP search problems in low fragments of bounded arithmetic
inferredcites →https://doi.org/10.2307/2275250openalex-snapshot
Lower bounds to the size of constant-depth propositional proofs
inferredcites →https://doi.org/10.2307/2275541openalex-snapshot
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
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.1002/malq.201700034openalex-snapshot
Short refutations for an equivalence‐chain principle for constant‐depth formulas
inferred← citeshttps://doi.org/10.1007/s00037-025-00271-wopenalex-snapshot
Quantum Automating TC0-Frege Is LWE-Hard
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102892openalex-snapshot
The canonical pairs of bounded depth Frege systems
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103496openalex-snapshot
First-order reasoning and efficient semi-algebraic proofs
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/bsl.2017.32openalex-snapshot
INCOMPLETENESS IN THE FINITE DOMAIN
inferred← citeshttps://doi.org/10.1109/focs.2019.00038openalex-snapshot
Automating Resolution is NP-Hard
inferred← citeshttps://doi.org/10.3233/faia200990openalex-snapshot
Chapter 7. Proof Complexity and SAT Solving
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.