On the public citation graph

Time–Space Tradeoffs for SAT on Nonuniform Machines

https://doi.org/10.1006/jcss.2001.1767
0 signed · 49 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/bf01301970openalex-snapshot
Alternating time versus deterministic time: A separation
inferredcites →https://doi.org/10.1007/bf01744430openalex-snapshot
A time-space tradeoff for language recognition
inferredcites →https://doi.org/10.1007/bf01744432openalex-snapshot
Towards separating nondeterminism from determinism
inferredcites →https://doi.org/10.1016/0020-0190(88)90152-4openalex-snapshot
Short propositional formulas represent nondeterministic computations
inferredcites →https://doi.org/10.1016/0022-0000(86)90004-8openalex-snapshot
Time-space trade-offs for branching programs
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(86)90150-7openalex-snapshot
Two time-space tradeoffs for element distinctness
inferredcites →https://doi.org/10.1016/0304-3975(91)90177-4openalex-snapshot
An O(T log T) reduction from RAM computations to satisfiability
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0022-0000(70)80031-9openalex-snapshot
Time- and tape-bounded turing acceptors and AFLs
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/ccc.2000.856730openalex-snapshot
Time-space tradeoffs for nondeterministic computation
inferredcites →https://doi.org/10.1109/sfcs.1983.39openalex-snapshot
On determinism versus non-determinism and related problems
inferredcites →https://doi.org/10.1109/sfcs.1998.743453openalex-snapshot
Time-space tradeoffs for branching programs
inferredcites →https://doi.org/10.1109/sfcs.2000.892078openalex-snapshot
Super-linear time-space tradeoff lower bounds for randomized computation
inferredcites →https://doi.org/10.1109/sffcs.1999.814578openalex-snapshot
A non-linear time lower bound for Boolean branching programs
inferredcites →https://doi.org/10.1109/sffcs.1999.814618openalex-snapshot
On the complexity of SAT
inferredcites →https://doi.org/10.1109/swat.1966.30openalex-snapshot
The recognition problem for the set of perfect squares
inferredcites →https://doi.org/10.1137/0220017openalex-snapshot
A general Sequential Time-Space Tradeoff for Finding Unique Elements
inferredcites →https://doi.org/10.1145/301250.301424openalex-snapshot
Determinism versus non-determinism for linear time RAMs (extended abstract)
inferredcites →https://doi.org/10.1145/321356.321362openalex-snapshot
Two-Tape Simulation of Multitape Turing Machines
inferredcites →https://doi.org/10.1145/322003.322015openalex-snapshot
On Time Versus Space
inferredcites →https://doi.org/10.1145/322123.322138openalex-snapshot
Relations Among Complexity Measures
inferredcites →https://doi.org/10.1145/79147.214070openalex-snapshot
Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space
inferredcites →https://doi.org/10.1145/800141.804678openalex-snapshot
Some connections between nonuniform and uniform complexity classes
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures

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-642-40313-2_1openalex-snapshot
Alternation Trading Proofs and Their Limitations
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-013-0069-5openalex-snapshot
Amplifying circuit lower bounds against polynomial time, with applications
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.1109/ccc.2007.34openalex-snapshot
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
inferred← citeshttps://doi.org/10.1109/ccc.2011.36openalex-snapshot
Non-uniform ACC Circuit Lower Bounds
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.1109/ccc.2012.44openalex-snapshot
Amplifying Circuit Lower Bounds against Polynomial Time with Applications
inferred← citeshttps://doi.org/10.1109/ccc.2014.13openalex-snapshot
AM with Multiple Merlins
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00069openalex-snapshot
Constructive Separations and Their Consequences
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.1145/2559903openalex-snapshot
Nonuniform ACC Circuit 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.4036/iis.2014.1openalex-snapshot
Proving Circuit Lower Bounds in High Uniform Classes
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.34openalex-snapshot
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
inferred← citeshttps://doi.org/10.46298/theoretics.24.3openalex-snapshot
Constructive Separations and Their Consequences
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0249openalex-snapshot
Algorithms versus Circuit Lower Bounds
inferred← citeshttps://doi.org/10.7916/d8zp45ktopenalex-snapshot
Unconditional Lower Bounds in Complexity Theory
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.