On the public citation graph
Tautologies from Pseudo-Random Generators
0 signed · 74 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.19900360106openalex-snapshot
Quantified propositional calculi and fragments of bounded arithmetic
inferredcites →https://doi.org/10.1006/inco.1997.2674openalex-snapshot
Some Consequences of Cryptographical Conjectures forS12and EF
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_10openalex-snapshot
On Frege and Extended Frege Proof Systems
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_12openalex-snapshot
Bounded Arithmetic and Lower Bounds in Boolean Complexity
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_19openalex-snapshot
Some Relations Between Subsystems of Arithmetic and Complexity of Computations
inferredcites →https://doi.org/10.1007/bfb0075316openalex-snapshot
Counting problems in bounded arithmetic
inferredcites →https://doi.org/10.1016/0168-0072(91)90043-lopenalex-snapshot
Bounded arithmetic and the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1017/s0022481200028061openalex-snapshot
Provability of the pigeonhole principle and the existence of infinitely many primes
inferredcites →https://doi.org/10.1145/335305.335348openalex-snapshot
A new proof of the weak pigeonhole principle
inferredcites →https://doi.org/10.1145/800133.804354openalex-snapshot
Propositional representation of arithmetic proofs (Preliminary Version)
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.2307/2274765openalex-snapshot
Propositional proof systems, the consistency of first order theories and the complexity of computations
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
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.200710069openalex-snapshot
On the correspondence between arithmetic theories and propositional proof systems – a survey
inferred← citeshttps://doi.org/10.1007/11750321_23openalex-snapshot
Disjoint NP-Pairs from Propositional Proof Systems
inferred← citeshttps://doi.org/10.1007/3-540-32743-6_8openalex-snapshot
Von der Turingmaschine zum Quantencomputer — ein Gang durch die Geschichte der Komplexitätstheorie
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_19openalex-snapshot
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_3openalex-snapshot
Proof Complexity of Non-classical Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-31485-8openalex-snapshot
Lectures on Logic and Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-31485-8_1openalex-snapshot
Proof Complexity of Non-classical Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_58openalex-snapshot
The Complexity of Proving That a Graph Is Ramsey
inferred← citeshttps://doi.org/10.1007/s00153-005-0279-xopenalex-snapshot
Hardness assumptions in the foundations of theoretical computer science
inferred← citeshttps://doi.org/10.1007/s00153-014-0398-3openalex-snapshot
Partially definable forcing and bounded arithmetic
inferred← citeshttps://doi.org/10.1007/s00224-011-9354-3openalex-snapshot
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography
inferred← citeshttps://doi.org/10.1007/s00493-015-3193-9openalex-snapshot
The complexity of proving that a graph is Ramsey
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.09.002openalex-snapshot
Substitutions into propositional tautologies
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.2023.40openalex-snapshot
ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00067openalex-snapshot
On the Range Avoidance Problem for Circuits
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00044openalex-snapshot
Jump Operators, Interactive Proofs and Proof Complexity Generators
inferred← citeshttps://doi.org/10.1109/synasc.2009.9openalex-snapshot
On the Existence of Complete Disjoint NP-Pairs
inferred← citeshttps://doi.org/10.1137/21m1447519openalex-snapshot
Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity
inferred← citeshttps://doi.org/10.1142/s0219061311000979openalex-snapshot
ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD NP ∩ coNP FUNCTION
inferred← citeshttps://doi.org/10.1145/1131313.1131314openalex-snapshot
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations
inferred← citeshttps://doi.org/10.1145/2951860.2951874openalex-snapshot
SIGACT News Complexity Theory Column 91
inferred← citeshttps://doi.org/10.1145/3406325.3451010openalex-snapshot
Iterated lower bound formulas: a diagonalization-based approach to proof complexity
inferred← citeshttps://doi.org/10.1145/3618260.3649624openalex-snapshot
Symmetric Exponential Time Requires Near-Maximum Circuit Size
inferred← citeshttps://doi.org/10.1145/3778166openalex-snapshot
Symmetric Exponential Time Requires Near-Maximum Circuit Size
inferred← citeshttps://doi.org/10.1145/3798129.3800780openalex-snapshot
Kolmogorov’s Approach to P vs. NP: Chain Rules for Time-Bounded Kolmogorov Complexity
inferred← citeshttps://doi.org/10.2178/jsl/1080938841openalex-snapshot
Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds
inferred← citeshttps://doi.org/10.2178/jsl/1120224731openalex-snapshot
Structured pigeonhole principle, search problems and hard tautologies
inferred← citeshttps://doi.org/10.4007/annals.2015.181.2.1openalex-snapshot
Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.30openalex-snapshot
On extracting computations from propositional proofs (a survey)
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.