On the public citation graph
Towards separating nondeterminism from determinism
0 signed · 45 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.1016/0304-3975(80)90036-5openalex-snapshot
On time-space classes and their relation to the theory of real addition
inferredcites →https://doi.org/10.1016/b978-0-12-545075-1.50007-9openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1016/s0022-0000(73)80028-5openalex-snapshot
A hierarchy for nondeterministic time complexity
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1145/321724.321727openalex-snapshot
A Note Concerning Nondeterministic Tape Complexities
inferredcites →https://doi.org/10.1145/322047.322061openalex-snapshot
Separating Nondeterministic Time Complexity Classes
inferredcites →https://doi.org/10.1145/800135.804426openalex-snapshot
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1671openalex-snapshot
Time–Space Tradeoffs for Satisfiability
inferred← citeshttps://doi.org/10.1006/jcss.2001.1767openalex-snapshot
Time–Space Tradeoffs for SAT on Nonuniform Machines
inferred← citeshttps://doi.org/10.1007/11523468_79openalex-snapshot
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_1openalex-snapshot
Alternation Trading Proofs and Their Limitations
inferred← citeshttps://doi.org/10.1007/bf01179374openalex-snapshot
Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines
inferred← citeshttps://doi.org/10.1007/s00037-007-0221-1openalex-snapshot
Inductive Time-Space Lower Bounds for Sat and Related Problems
inferred← citeshttps://doi.org/10.1007/s00037-008-0248-yopenalex-snapshot
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
inferred← citeshttps://doi.org/10.1007/s00037-015-0104-9openalex-snapshot
Limits on Alternation Trading Proofs for Time–Space Lower Bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.020openalex-snapshot
A time lower bound for satisfiability
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00227-1openalex-snapshot
Lower bounds on the complexity of recognizing SAT by Turing machines
inferred← citeshttps://doi.org/10.1109/ccc.1997.612300openalex-snapshot
Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability
inferred← citeshttps://doi.org/10.1109/ccc.2000.856730openalex-snapshot
Time-space tradeoffs for nondeterministic computation
inferred← citeshttps://doi.org/10.1109/ccc.2000.856732openalex-snapshot
Time-space lower bounds for SAT on uniform and non-uniform machines
inferred← citeshttps://doi.org/10.1109/ccc.2001.933895openalex-snapshot
On separators, segregators and time versus space
inferred← citeshttps://doi.org/10.1109/ccc.2005.6openalex-snapshot
Better Time-Space Lower Bounds for SAT and Related Problems
inferred← citeshttps://doi.org/10.1109/ccc.2007.34openalex-snapshot
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
inferred← citeshttps://doi.org/10.1109/ccc.2012.30openalex-snapshot
Limits on Alternation-Trading Proofs for Time-Space Lower Bounds
inferred← citeshttps://doi.org/10.1137/0222011openalex-snapshot
${\text{ASPACE}}(o(\log \log n))$ is Regular
inferred← citeshttps://doi.org/10.1137/050642228openalex-snapshot
Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines
inferred← citeshttps://doi.org/10.1137/10080703xopenalex-snapshot
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
inferred← citeshttps://doi.org/10.1145/1101821.1101822openalex-snapshot
Time-space lower bounds for satisfiability
inferred← citeshttps://doi.org/10.1145/1806689.1806723openalex-snapshot
Improving exhaustive search implies superpolynomial lower bounds
inferred← citeshttps://doi.org/10.1145/2493246.2493249openalex-snapshot
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
inferred← citeshttps://doi.org/10.1561/9781601980854openalex-snapshot
A Survey of Lower Bounds for Satisfiability and Related Problems
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.50openalex-snapshot
Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers
inferred← citeshttps://doi.org/10.47749/t/unicamp.2010.772316openalex-snapshot
Complexidade computacional e o problema P vs NP
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0746openalex-snapshot
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5862openalex-snapshot
On Regular Sets of Bounds and Determinism versus Nondeterminism
inferred← citeshttps://doi.org/10.48550/arxiv.1309.7457openalex-snapshot
On the Tape-Number Problem for Deterministic Time Classes
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.