On the public citation graph
Application of separability and independence notions for proving lower bounds of circuit complexity
0 signed · 46 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.1090/pspum/007/0157289openalex-snapshot
Helly’s theorem and its relatives
inferredcites →https://doi.org/10.1145/321752.321761openalex-snapshot
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcom.1999.0526openalex-snapshot
Time-Space Tradeoffs in Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_40openalex-snapshot
Space-time tradeoffs for oblivious integer multiplication
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_251openalex-snapshot
Time space tradeoffs (getting closer to the barrier?)
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_16openalex-snapshot
The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_2openalex-snapshot
Lower Bounds for Unrestricted Boolean Circuits: Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-68402-9_8openalex-snapshot
Planar Circuit Complexity and The Performance of VLSI Algorithms +
inferred← citeshttps://doi.org/10.1007/bf01084394openalex-snapshot
Complexity of additive computations of systems of linear forms
inferred← citeshttps://doi.org/10.1007/bf01744566openalex-snapshot
Space-time tradeoffs for linear recursion
inferred← citeshttps://doi.org/10.1007/bf02104745openalex-snapshot
Lower bounds in algebraic computational complexity
inferred← citeshttps://doi.org/10.1007/bfb0030842openalex-snapshot
Extending the Hong-Kung model to memory hierarchies
inferred← citeshttps://doi.org/10.1007/s10618-019-00669-5openalex-snapshot
Parameterized low-rank binary matrix approximation
inferred← citeshttps://doi.org/10.1007/s10958-006-0333-1openalex-snapshot
Evolution in random environment and structural instability
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90020-5openalex-snapshot
Extreme time-space tradeoffs for graphs with small space requirements
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90056-2openalex-snapshot
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90037-4openalex-snapshot
A time-space tradeoff for sorting on non-oblivious machines
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90029-1openalex-snapshot
Time-space tradeoffs for matrix multiplication and the discrete fourier transform on any general sequential random-access computer
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90033-3openalex-snapshot
The performance of multilective VLSI algorithms
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90014-vopenalex-snapshot
Time-space tradeoffs for algebraic problems on general sequential machines
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90028-hopenalex-snapshot
Trade-offs between communication and space
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90014-7openalex-snapshot
Additive complexity in directed computations
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90060-5openalex-snapshot
Time-space efficient algorithms for computing convolutions and related problems
inferred← citeshttps://doi.org/10.1109/fscs.1990.89561openalex-snapshot
A time-space tradeoff for Boolean matrix multiplication
inferred← citeshttps://doi.org/10.1109/fscs.1990.89562openalex-snapshot
Communication-space tradeoffs for unrestricted protocols
inferred← citeshttps://doi.org/10.1109/sfcs.1979.4openalex-snapshot
A time-space tradeoff for sorting on non-oblivious machines
inferred← citeshttps://doi.org/10.1109/sfcs.1982.32openalex-snapshot
Optimal allocation of computational resources in VLSI
inferred← citeshttps://doi.org/10.1109/sfcs.1986.58openalex-snapshot
Time-space tradeoffs for branching programs contrasted with those for straight-line programs
inferred← citeshttps://doi.org/10.1109/tc.1983.1676281openalex-snapshot
Time-Space Tradeoffs on Back-to-Back FFT Algorithms
inferred← citeshttps://doi.org/10.1137/17m112258xopenalex-snapshot
Matrix Rigidity from the Viewpoint of Parameterized Complexity
inferred← citeshttps://doi.org/10.1145/1008861.1008867openalex-snapshot
Complexity of approximation algorithms for combinatorial problems
inferred← citeshttps://doi.org/10.1145/567752.567765openalex-snapshot
Space-time tradeoffs for linear recursion
inferred← citeshttps://doi.org/10.1145/73007.73028openalex-snapshot
Tradeoffs between communication and space
inferred← citeshttps://doi.org/10.1145/800141.804680openalex-snapshot
Space-time tradeoffs and first order problems in a model of programs
inferred← citeshttps://doi.org/10.1145/800141.804681openalex-snapshot
Graph pebbling with many free pebbles can be difficult
inferred← citeshttps://doi.org/10.1145/800141.804682openalex-snapshot
Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations
inferred← citeshttps://doi.org/10.1561/0400000063openalex-snapshot
Complexity of Linear Boolean Operators
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.33openalex-snapshot
The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication
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.