On the public citation graph
Making Hard Problems Harder
0 signed · 58 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/3-540-45294-x_1openalex-snapshot
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
inferredcites →https://doi.org/10.1007/3-540-52282-4_44openalex-snapshot
Efficient checking of computations
inferredcites →https://doi.org/10.1007/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferredcites →https://doi.org/10.1007/bf01305237openalex-snapshot
Pseudorandom generators for space-bounded computation
inferredcites →https://doi.org/10.1007/bfb0058034openalex-snapshot
On resource-bounded measure and pseudorandomness
inferredcites →https://doi.org/10.1007/s00037-004-0187-1openalex-snapshot
The complexity of constructing pseudorandom generators from hard functions
inferredcites →https://doi.org/10.1016/j.ipl.2005.03.009openalex-snapshot
Reviewing bounds on the circuit size of the hardest functions
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/s0304-3975(99)00024-9openalex-snapshot
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
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.1997.612300openalex-snapshot
Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability
inferredcites →https://doi.org/10.1109/focs.2004.29openalex-snapshot
Extracting Randomness Using Few Independent Sources
inferredcites →https://doi.org/10.1109/focs.2004.33openalex-snapshot
Hierarchy Theorems for Probabilistic Polynomial Time
inferredcites →https://doi.org/10.1109/sct.1988.5260openalex-snapshot
Decision trees and downward closures
inferredcites →https://doi.org/10.1109/sct.1995.514853openalex-snapshot
A personal view of average-case complexity
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1993.366874openalex-snapshot
On representations by low-degree polynomials
inferredcites →https://doi.org/10.1109/sfcs.2001.959941openalex-snapshot
Simple extractors for all min-entropies and a new pseudo-random generator
inferredcites →https://doi.org/10.1109/sfcs.2003.1238205openalex-snapshot
On Worst‐Case to Average‐Case Reductions for NP Problems
inferredcites →https://doi.org/10.1109/sffcs.1999.814590openalex-snapshot
Near-optimal conversion of hardness into pseudo-randomness
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0222061openalex-snapshot
Random-Self-Reducibility of Complete Sets
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.1142/9789812562494_0013openalex-snapshot
RECENT DEVELOPMENTS IN EXPLICIT CONSTRUCTIONS OF EXTRACTORS
inferredcites →https://doi.org/10.1145/100216.100242openalex-snapshot
Pseudorandom generators for space-bounded computations
inferredcites →https://doi.org/10.1145/1060590.1060593openalex-snapshot
Extractors with weak random seeds
inferredcites →https://doi.org/10.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits
inferredcites →https://doi.org/10.1145/174130.174138openalex-snapshot
Constant depth circuits, Fourier transform, and learnability
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/380752.380790openalex-snapshot
Loss-less condensers, unbalanced expanders, and extractors
inferredcites →https://doi.org/10.1145/502090.502099openalex-snapshot
Extractors and pseudorandom generators
inferredcites →https://doi.org/10.1145/509907.509997openalex-snapshot
Pseudo-random generators for all hardnesses
inferredcites →https://doi.org/10.1561/0400000009openalex-snapshot
Pairwise Independence and Derandomization
inferredcites →https://doi.org/10.1561/9781933019765openalex-snapshot
Pairwise Independence and Derandomization
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-0087-yopenalex-snapshot
On Uniformity and Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00037-024-00261-4openalex-snapshot
Learning algorithms from circuit lower bounds
inferred← citeshttps://doi.org/10.1109/ccc.2013.40openalex-snapshot
On Medium-Uniformity and Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00051openalex-snapshot
The Hardest Explicit Construction
inferred← citeshttps://doi.org/10.1137/080734030openalex-snapshot
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
inferred← citeshttps://doi.org/10.1145/1374376.1374460openalex-snapshot
Uniform direct product theorems
inferred← citeshttps://doi.org/10.1145/1806689.1806703openalex-snapshot
Hardness amplification in 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/3618260.3649711openalex-snapshot
Hardness Condensation by Restriction
inferred← citeshttps://doi.org/10.1145/3717823.3718224openalex-snapshot
Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin
inferred← citeshttps://doi.org/10.1145/3717823.3718229openalex-snapshot
Supercritical Tradeoffs for Monotone Circuits
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.236openalex-snapshot
On the NP-Completeness of the Minimum Circuit Size Problem
showing the first 12 of 13 · page through all 13
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.