On the public citation graph
Proving Lower Bounds Via Pseudo-random Generators
0 signed · 130 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/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1006/jcss.1999.1671openalex-snapshot
Time–Space Tradeoffs for Satisfiability
inferredcites →https://doi.org/10.1007/3-540-09519-5openalex-snapshot
Symbolic and Algebraic Computation
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/ccc.2003.1214434openalex-snapshot
On derandomizing tests for certain polynomial identities
inferredcites →https://doi.org/10.1109/fscs.1990.89575openalex-snapshot
Simple construction of almost k-wise independent random variables
inferredcites →https://doi.org/10.1109/sct.1991.160269openalex-snapshot
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
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.1137/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/s009753970038715xopenalex-snapshot
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/100216.100244openalex-snapshot
Small-bias probability spaces: efficient constructions and applications
inferredcites →https://doi.org/10.1145/1060590.1060647openalex-snapshot
Undirected ST-connectivity in log-space
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/780542.780595openalex-snapshot
Derandomizing polynomial identity tests means proving circuit lower bounds
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-319-05446-9_7openalex-snapshot
Progress on Polynomial Identity Testing-II
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_22openalex-snapshot
Depth-4 Identity Testing and Noether’s Normalization Lemma
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_29openalex-snapshot
Asymptotically Optimal Hitting Sets Against Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_2openalex-snapshot
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_23openalex-snapshot
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_52openalex-snapshot
Improved Polynomial Identity Testing for Read-Once Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_35openalex-snapshot
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_31openalex-snapshot
Recent Results on Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_4openalex-snapshot
On the Arithmetic Complexity of Euler Function
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_61openalex-snapshot
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_10openalex-snapshot
Algebraic Independence and Blackbox Identity Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_35openalex-snapshot
Lower Bounds against Weakly Uniform Circuits
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_35openalex-snapshot
Testing Equivalence of Polynomials under Shifts
inferred← citeshttps://doi.org/10.1007/978-981-92-3309-0_34openalex-snapshot
On the Border Complexity of Sums of ROFs
inferred← citeshttps://doi.org/10.1007/s00037-009-0284-2openalex-snapshot
Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristic
inferred← citeshttps://doi.org/10.1007/s00037-012-0054-4openalex-snapshot
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
inferred← citeshttps://doi.org/10.1007/s00037-015-0100-0openalex-snapshot
Mining Circuit Lower Bound Proofs for Meta-Algorithms
inferred← citeshttps://doi.org/10.1007/s00037-015-0102-yopenalex-snapshot
Equivalence of Polynomial Identity Testing and Polynomial Factorization
inferred← citeshttps://doi.org/10.1007/s00037-015-0103-xopenalex-snapshot
Unifying Known Lower Bounds via Geometric Complexity Theory
inferred← citeshttps://doi.org/10.1007/s00037-015-0105-8openalex-snapshot
Read-once polynomial identity testing
inferred← citeshttps://doi.org/10.1007/s00037-016-0131-1openalex-snapshot
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas
inferred← citeshttps://doi.org/10.1007/s00037-016-0141-zopenalex-snapshot
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
inferred← citeshttps://doi.org/10.1007/s00037-020-00200-zopenalex-snapshot
Linear Matroid Intersection is in Quasi-NC
inferred← citeshttps://doi.org/10.1007/s00037-021-00205-2openalex-snapshot
Lower Bounds for Matrix Factorization
inferred← citeshttps://doi.org/10.1007/s00037-021-00209-yopenalex-snapshot
Blackbox identity testing for sum of special ROABPs and its border class
inferred← citeshttps://doi.org/10.1007/s00453-013-9823-yopenalex-snapshot
Lower Bounds Against Weakly-Uniform Threshold Circuits
inferred← citeshttps://doi.org/10.1007/s00493-011-2537-3openalex-snapshot
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.013openalex-snapshot
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.09.029openalex-snapshot
Deterministically testing sparse polynomial identities of unbounded degree
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.08.001openalex-snapshot
Towards a tight hardness–randomness connection between permanent and arithmetic circuit identity testing
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.036openalex-snapshot
A Wronskian approach to the real τ-conjecture
inferred← citeshttps://doi.org/10.1016/s0065-2458(09)01204-2openalex-snapshot
Chapter 4 A Status Report on the P Versus NP Question
inferred← citeshttps://doi.org/10.1017/fms.2022.100openalex-snapshot
A generalized Sylvester–Gallai-type theorem for quadratic polynomials
inferred← citeshttps://doi.org/10.1073/pnas.1901272116openalex-snapshot
Bootstrapping variables in algebraic circuits
inferred← citeshttps://doi.org/10.1090/jams/864openalex-snapshot
Geometric complexity theory V: Efficient algorithms for Noether normalization
inferred← citeshttps://doi.org/10.1109/ccc.2008.15openalex-snapshot
Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In
inferred← citeshttps://doi.org/10.1109/ccc.2009.20openalex-snapshot
An Almost Optimal Rank Bound for Depth-3 Identities
inferred← citeshttps://doi.org/10.1109/ccc.2014.25openalex-snapshot
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization
inferred← citeshttps://doi.org/10.1109/ccc.2014.34openalex-snapshot
Mining Circuit Lower Bound Proofs for Meta-algorithms
inferred← citeshttps://doi.org/10.1109/focs.2009.67openalex-snapshot
Blackbox Polynomial Identity Testing for Depth 3 Circuits
inferred← citeshttps://doi.org/10.1109/focs.2010.9openalex-snapshot
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits
inferred← citeshttps://doi.org/10.1109/focs.2012.15openalex-snapshot
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma
inferred← citeshttps://doi.org/10.1109/focs.2013.34openalex-snapshot
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1109/focs.2015.35openalex-snapshot
Deterministic Divisibility Testing via Shifted Partial Derivatives
inferred← citeshttps://doi.org/10.1109/focs.2019.00018openalex-snapshot
Derandomization from Algebraic Hardness: Treading the Borders
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00018openalex-snapshot
Demystifying the border of depth-3 algebraic circuits
inferred← citeshttps://doi.org/10.1134/s0032946023010052openalex-snapshot
Testing the Satisfiability of Algebraic Formulas over the Field of Two Elements
inferred← citeshttps://doi.org/10.1137/080735850openalex-snapshot
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
inferred← citeshttps://doi.org/10.1137/090770679openalex-snapshot
An Almost Optimal Rank Bound for Depth-3 Identities
inferred← citeshttps://doi.org/10.1137/10848232openalex-snapshot
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
inferred← citeshttps://doi.org/10.1137/140975103openalex-snapshot
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
inferred← citeshttps://doi.org/10.1137/20m1347395openalex-snapshot
Derandomization from Algebraic Hardness
inferred← citeshttps://doi.org/10.1145/1374376.1374446openalex-snapshot
A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2
inferred← citeshttps://doi.org/10.1145/1806689.1806779openalex-snapshot
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
inferred← citeshttps://doi.org/10.1145/1944345.1944346openalex-snapshot
On P vs. NP and geometric complexity theory
inferred← citeshttps://doi.org/10.1145/1993636.1993694openalex-snapshot
Blackbox identity testing for bounded top fanin depth-3 circuits
inferred← citeshttps://doi.org/10.1145/2090236.2090275openalex-snapshot
Marginal hitting sets imply super-polynomial lower bounds for permanent
inferred← citeshttps://doi.org/10.1145/2184319.2184341openalex-snapshot
The GCT program toward the P vs. NP problem
inferred← citeshttps://doi.org/10.1145/2213977.2213995openalex-snapshot
On identity testing of tensors, low-rank recovery and compressed sensing
inferred← citeshttps://doi.org/10.1145/2213977.2214035openalex-snapshot
Reconstruction of depth-4 multilinear circuits with top fan-in 2
inferred← citeshttps://doi.org/10.1145/2528403openalex-snapshot
From sylvester-gallai configurations to rank bounds
inferred← citeshttps://doi.org/10.1145/2591796.2591816openalex-snapshot
Hitting sets for multilinear read-once algebraic branching programs, in any order
inferred← citeshttps://doi.org/10.1145/3055399.3055496openalex-snapshot
Succinct hitting sets and barriers to proving algebraic circuits lower bounds
inferred← citeshttps://doi.org/10.1145/3170709openalex-snapshot
Identity Testing and Lower Bounds for Read- k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1145/3196836openalex-snapshot
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas
inferred← citeshttps://doi.org/10.1145/3282427openalex-snapshot
Reconstruction of Full Rank Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1145/3313276.3316341openalex-snapshot
Sylvester-Gallai type theorems for quadratic polynomials
inferred← citeshttps://doi.org/10.1145/3369928openalex-snapshot
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits
inferred← citeshttps://doi.org/10.1145/3406325.3451013openalex-snapshot
Polynomial time deterministic identity testing algorithm for Σ [3] ΠΣΠ [2] circuits via Edelstein–Kelly type theorem for quadratic polynomials
inferred← citeshttps://doi.org/10.1145/3406325.3451096openalex-snapshot
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
inferred← citeshttps://doi.org/10.1145/3618260.3649617openalex-snapshot
Strong Algebras and Radical Sylvester-Gallai Configurations
inferred← citeshttps://doi.org/10.1145/3665800openalex-snapshot
Hitting Sets for Orbits of Circuit Classes and Polynomial Families
inferred← citeshttps://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
inferred← citeshttps://doi.org/10.1561/9781601984814openalex-snapshot
Partial Derivatives in Arithmetic Complexity and Beyond
inferred← citeshttps://doi.org/10.16943/ptinsa/2017/49224openalex-snapshot
Improved Lower Bound for Multi-R-IC Depth Four Circuits as a Function of the Number of Input Variables
inferred← citeshttps://doi.org/10.31274/etd-180810-4556openalex-snapshot
Randomness in completeness and space-bounded computations
inferred← citeshttps://doi.org/10.31857/s0555292323010059openalex-snapshot
Testing the satisfiability of algebraic formulas over the field of two elements
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2015.304openalex-snapshot
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2015.323openalex-snapshot
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.29openalex-snapshot
Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.30openalex-snapshot
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.32openalex-snapshot
Proof Complexity Lower Bounds from Algebraic Circuit Complexity
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.5openalex-snapshot
Lower Bounds for Matrix Factorization
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2009.2333openalex-snapshot
The Power of Depth 2 Circuits over Algebras
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.296openalex-snapshot
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.127openalex-snapshot
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2477openalex-snapshot
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
inferred← citeshttps://doi.org/10.48550/arxiv.0709.0748openalex-snapshot
On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view
inferred← citeshttps://doi.org/10.48550/arxiv.0907.5575openalex-snapshot
A hitting set construction, with application to arithmetic circuit lower bounds
inferred← citeshttps://doi.org/10.48550/arxiv.0912.2565openalex-snapshot
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1002.0145openalex-snapshot
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1004.4960openalex-snapshot
Shallow Circuits with High-Powered Inputs
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5668openalex-snapshot
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1826openalex-snapshot
Hitting-sets for low-distance multilinear depth-3
inferred← citeshttps://doi.org/10.48550/arxiv.1512.01256openalex-snapshot
Reconstruction of depth-3, top fan-in two circuits over characteristic zero fields
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01717openalex-snapshot
Towards an algebraic natural proofs barrier via polynomial identity testing
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07180openalex-snapshot
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good
inferred← citeshttps://doi.org/10.48550/arxiv.1805.06692openalex-snapshot
A Note on Polynomial Identity Testing for Depth-3 Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06323openalex-snapshot
Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
inferred← citeshttps://doi.org/10.48550/arxiv.2105.01751openalex-snapshot
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits
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.