On the public citation graph

Forcing with Random Variables and Proof Complexity

https://doi.org/10.1007/11780342_29
0 signed · 29 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.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1017/cbo9781107325630.013openalex-snapshot
ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
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-540-72504-6_2openalex-snapshot
Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_3openalex-snapshot
Zero Knowledge and Circuit Minimization
inferred← citeshttps://doi.org/10.1007/s00037-024-00261-4openalex-snapshot
Learning algorithms from circuit lower bounds
inferred← citeshttps://doi.org/10.1007/s00153-012-0304-9openalex-snapshot
A saturation property of structures obtained by forcing with a compact family of random variables
inferred← citeshttps://doi.org/10.1007/s00153-014-0398-3openalex-snapshot
Partially definable forcing and bounded arithmetic
inferred← citeshttps://doi.org/10.1007/s00153-019-00681-yopenalex-snapshot
Polynomial time ultrapowers and the consistency of circuit lower bounds
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.009openalex-snapshot
Towards NP – P via proof complexity and search
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102930openalex-snapshot
Typical forcings, NP search problems and an extension of a theorem of Riis
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/jsl.2021.99openalex-snapshot
NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN
inferred← citeshttps://doi.org/10.1090/s0002-9939-2015-12610-xopenalex-snapshot
A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems
inferred← citeshttps://doi.org/10.1109/focs.2019.00038openalex-snapshot
Automating Resolution is NP-Hard
inferred← citeshttps://doi.org/10.1112/blms/bdt071openalex-snapshot
On the computational complexity of finding hard tautologies
inferred← citeshttps://doi.org/10.1142/s0219061325500023openalex-snapshot
Learning algorithms versus automatability of Frege systems
inferred← citeshttps://doi.org/10.1145/2559950openalex-snapshot
Improved witnessing and local improvement principles for second-order bounded arithmetic
inferred← citeshttps://doi.org/10.1145/2656209openalex-snapshot
Exponential Lower Bounds for AC 0 -Frege Imply Superpolynomial Frege Lower Bounds
inferred← citeshttps://doi.org/10.1145/3060145openalex-snapshot
The NP Search Problems of Frege and Extended Frege Proofs
inferred← citeshttps://doi.org/10.1145/3538391openalex-snapshot
Beyond Natural Proofs: Hardness Magnification and Locality
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.30openalex-snapshot
On extracting computations from propositional proofs (a survey)
inferred← citeshttps://doi.org/10.48550/arxiv.1210.4692openalex-snapshot
Randomness, pseudorandomness and models of arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2501openalex-snapshot
A reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systems
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00118openalex-snapshot
Expansions of pseudofinite structures and circuit and proof complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1607.00443openalex-snapshot
Algebraic Proof Complexity: Progress, Frontiers and Challenges
inferred← citeshttps://doi.org/10.48550/arxiv.1909.03691openalex-snapshot
The Cook-Reckhow definition
inferred← citeshttps://doi.org/10.48550/arxiv.2104.04711openalex-snapshot
Information in propositional proofs and algorithmic proof search
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.