On the public citation graph
Low-End Uniform Hardness versus Randomness Tradeoffs for AM
0 signed · 55 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.1006/jcss.2000.1730openalex-snapshot
Pseudorandom Generators without the XOR Lemma
inferredcites →https://doi.org/10.1006/jcss.2001.1763openalex-snapshot
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
inferredcites →https://doi.org/10.1007/11538462_39openalex-snapshot
Reconstructive Dispersers and Hitting Set Generators
inferredcites →https://doi.org/10.1007/3-540-52282-4_30openalex-snapshot
Hiding instances in multioracle queries
inferredcites →https://doi.org/10.1007/3-540-52282-4_44openalex-snapshot
Efficient checking of computations
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf01200430openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
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-005-0197-7openalex-snapshot
Derandomizing Arthur–Merlin Games using Hitting Sets
inferredcites →https://doi.org/10.1007/s00037-007-0218-9openalex-snapshot
Pseudorandomness for Approximate Counting and Sampling
inferredcites →https://doi.org/10.1007/s00145-003-0217-1openalex-snapshot
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors
inferredcites →https://doi.org/10.1007/s00145-003-0237-xopenalex-snapshot
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
inferredcites →https://doi.org/10.1007/s00493-006-0036-8openalex-snapshot
Reducing The Seed Length In The Nisan-Wigderson Generator*
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/s0022-0000(02)00024-7openalex-snapshot
In search of an easy witness: exponential time vs. probabilistic polynomial time
inferredcites →https://doi.org/10.1016/s0022-0000(03)00046-1openalex-snapshot
Pseudo-random generators for all hardnesses
inferredcites →https://doi.org/10.1016/s0304-3975(99)00164-4openalex-snapshot
On pseudorandomness and resource-bounded measure
inferredcites →https://doi.org/10.1109/ccc.2002.1004348openalex-snapshot
Pseudorandomness and average-case complexity via uniform reductions
inferredcites →https://doi.org/10.1109/istcs.1995.377032openalex-snapshot
Some improvements to total degree tests
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1995.492584openalex-snapshot
Hard-core distributions for somewhat hard problems
inferredcites →https://doi.org/10.1109/sfcs.1998.743524openalex-snapshot
Randomness vs. time: de-randomization under a uniform assumption
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
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.1137/s0097539797325636openalex-snapshot
Weak Random Sources, Hitting Sets, and BPP Simulations
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/1059513.1059516openalex-snapshot
Simple extractors for all min-entropies and a new pseudorandom generator
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/200836.200880openalex-snapshot
Designing programs that check their work
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/509907.509997openalex-snapshot
Pseudo-random generators for all hardnesses
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-030-17653-2_17openalex-snapshot
Non-Malleable Codes Against Bounded Polynomial Time Tampering
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_6openalex-snapshot
(Nondeterministic) Hardness vs. Non-malleability
inferred← citeshttps://doi.org/10.1007/978-3-031-58737-5_2openalex-snapshot
Non-malleable Codes with Optimal Rate for Poly-Size Circuits
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_19openalex-snapshot
Uniform Black-Box Separations via Non-malleable Extractors
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_49openalex-snapshot
A PCP Characterization of AM
inferred← citeshttps://doi.org/10.1007/s00037-016-0128-9openalex-snapshot
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions
inferred← citeshttps://doi.org/10.1007/s00037-025-00279-2openalex-snapshot
Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.004openalex-snapshot
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00069openalex-snapshot
Constructive Separations and Their Consequences
inferred← citeshttps://doi.org/10.1145/1814370.1814389openalex-snapshot
Typically-correct derandomization
inferred← citeshttps://doi.org/10.1145/3618260.3649735openalex-snapshot
Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions
inferred← citeshttps://doi.org/10.1145/3717823.3718143openalex-snapshot
Extractors for Samplable Distributions with Low Min-Entropy
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.ccc.2016.9openalex-snapshot
Pseudorandomness When the Odds are Against You
inferred← citeshttps://doi.org/10.46298/theoretics.24.3openalex-snapshot
Constructive Separations and Their Consequences
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.