On the public citation graph
Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games
0 signed · 38 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/978-3-030-43662-9_4openalex-snapshot
Two Comments on Targeted Canonical Derandomizers
inferredcites →https://doi.org/10.1007/978-3-540-85238-4_18openalex-snapshot
Arthur and Merlin as Oracles
inferredcites →https://doi.org/10.1007/bf01275486openalex-snapshot
BPP has subexponential time simulations unlessEXPTIME has publishable proofs
inferredcites →https://doi.org/10.1007/s00037-003-0178-7openalex-snapshot
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
inferredcites →https://doi.org/10.1007/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferredcites →https://doi.org/10.1007/s00037-007-0218-9openalex-snapshot
Pseudorandomness for Approximate Counting and Sampling
inferredcites →https://doi.org/10.1007/s00037-011-0010-8openalex-snapshot
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
inferredcites →https://doi.org/10.1007/s00037-011-0019-zopenalex-snapshot
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/0022-0000(89)90020-2openalex-snapshot
Probabilistic complexity classes and lowness
inferredcites →https://doi.org/10.1016/0304-3975(83)90020-8openalex-snapshot
Some consequences of non-uniform conditions on uniform classes
inferredcites →https://doi.org/10.1016/j.ic.2005.01.002openalex-snapshot
Competing provers yield improved Karp–Lipton collapse results
inferredcites →https://doi.org/10.1016/s0019-9958(82)90382-5openalex-snapshot
Circuit-size lower bounds and non-reducibility to sparse sets
inferredcites →https://doi.org/10.1016/s0022-0000(02)00024-7openalex-snapshot
In search of an easy witness: exponential time vs. probabilistic polynomial time
inferredcites →https://doi.org/10.1109/ccc.2003.1214408openalex-snapshot
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games
inferredcites →https://doi.org/10.1137/s0097539700389652openalex-snapshot
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.4230/lipics.stacs.2008.1342openalex-snapshot
Finding Irrefutable Certificates for S_2^p via Arthur and Merlin
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00037-014-0095-yopenalex-snapshot
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
inferred← citeshttps://doi.org/10.1137/17m1145707openalex-snapshot
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
inferred← citeshttps://doi.org/10.1145/2488608.2488612openalex-snapshot
Natural proofs versus derandomization
inferred← citeshttps://doi.org/10.1145/3055399.3055414openalex-snapshot
Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace
inferred← citeshttps://doi.org/10.1515/9780823295708-025openalex-snapshot
CHAPTER NOTES AND REFERENCES
inferred← citeshttps://doi.org/10.1515/9783110203738.455openalex-snapshot
Chapter 8 Notes and References
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.645openalex-snapshot
Tighter Connections between Derandomization and Circuit Lower Bounds
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.10openalex-snapshot
Learning Algorithms from Natural Proofs
inferred← citeshttps://doi.org/10.48550/arxiv.1212.1891openalex-snapshot
Natural Proofs Versus Derandomization
inferred← citeshttps://doi.org/10.48550/arxiv.1701.04428openalex-snapshot
Some Results on Circuit Lower Bounds and Derandomization of Arthur-Merlin Problems
inferred← citeshttps://doi.org/10.5040/9780755625963.0007openalex-snapshot
Chapter Notes and References
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.