On the public citation graph
Classes of bounded nondeterminism
0 signed · 95 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.1007/3-540-08860-1_6openalex-snapshot
Relationship between density and deterministic complexity of MP-complete languages
inferredcites →https://doi.org/10.1007/3-540-16761-7_62openalex-snapshot
Complexity classes without machines: On complete languages for UP
inferredcites →https://doi.org/10.1007/bfb0028987openalex-snapshot
On the power of parity polynomial time
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
inferredcites →https://doi.org/10.1016/0304-3975(76)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/0304-3975(85)90158-6openalex-snapshot
Robust algorithms: A different approach to oracles
inferredcites →https://doi.org/10.1016/0304-3975(87)90078-8openalex-snapshot
On helping by robust oracle machines
inferredcites →https://doi.org/10.1016/s0019-9958(74)90473-2openalex-snapshot
Tally languages and complexity classes
inferredcites →https://doi.org/10.1109/psct.1987.10319267openalex-snapshot
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
inferredcites →https://doi.org/10.1109/sct.1989.41826openalex-snapshot
Turning machines with few accepting computations and low sets for PP
inferredcites →https://doi.org/10.1109/sfcs.1980.40openalex-snapshot
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0209003openalex-snapshot
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
inferredcites →https://doi.org/10.1137/0213023openalex-snapshot
Immunity, Relativizations, and Nondeterminism
inferredcites →https://doi.org/10.1145/2402.322399openalex-snapshot
Refining Nondeterminism in Relativizations of Complexity Classes
inferredcites →https://doi.org/10.1145/28395.28409openalex-snapshot
The Boolean formula value problem is in ALOGTIME
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.1094openalex-snapshot
Learning of Short Boolean Conjunctions from Negative Examples
inferred← citeshttps://doi.org/10.1006/inco.1995.1119openalex-snapshot
Defying Upward and Downward Separation
inferred← citeshttps://doi.org/10.1006/jcss.1996.0058openalex-snapshot
On Limited Nondeterminism and the Complexity of the V-C Dimension
inferred← citeshttps://doi.org/10.1006/jcss.1997.1490openalex-snapshot
On Fixed-Parameter Tractability and Approximability of NP Optimization Problems
inferred← citeshttps://doi.org/10.1006/jcss.2001.1775openalex-snapshot
The Minimum Equivalent DNF Problem and Shortest Implicants
inferred← citeshttps://doi.org/10.1007/11940128_25openalex-snapshot
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_27openalex-snapshot
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_65openalex-snapshot
On the Complexity and Inapproximability of Shortest Implicant Problems
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_46openalex-snapshot
The Inapproximability of Non NP-hard Optimization Problems
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_21openalex-snapshot
Defying upward and downward separation
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_72openalex-snapshot
Fault-tolerance and complexity (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_23openalex-snapshot
On the amount of nondeterminism and the power of verifying
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_167openalex-snapshot
On the structure of parameterized problems in NP
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_109openalex-snapshot
On the sparse set conjecture for sets with low density
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_122openalex-snapshot
Nonuniform lower bounds for exponential time classes
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_234openalex-snapshot
Molecular computing, bounded nondeterminism, and efficient recursion
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_7openalex-snapshot
The Complexity of Obtaining Solutions for Problems in NP and NL
inferred← citeshttps://doi.org/10.1007/bf01178668openalex-snapshot
On problems with short certificates
inferred← citeshttps://doi.org/10.1007/bfb0020817openalex-snapshot
Functional oracle queries as a measure of parallel time
inferred← citeshttps://doi.org/10.1007/bfb0023452openalex-snapshot
Resource-bounded kolmogorov complexity revisited
inferred← citeshttps://doi.org/10.1007/bfb0023453openalex-snapshot
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
inferred← citeshttps://doi.org/10.1007/bfb0030843openalex-snapshot
On log-time alternating Turing machines of alternation depth k
inferred← citeshttps://doi.org/10.1007/pl00008275openalex-snapshot
Molecular Computing, Bounded Nondeterminism, and Efficient Recursion
inferred← citeshttps://doi.org/10.1007/s002240000085openalex-snapshot
Sharply Bounded Alternation and Quasilinear Time
inferred← citeshttps://doi.org/10.1007/s10015-008-0521-9openalex-snapshot
Path-bounded three-dimensional finite automata
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00232-nopenalex-snapshot
On helping by parity-like languages
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90040-copenalex-snapshot
Relativized counting classes: Relations among thresholds, parity, and mods
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00080-3openalex-snapshot
Computing functions with parallel queries to NP
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00031-qopenalex-snapshot
On quasilinear-time complexity theory
inferred← citeshttps://doi.org/10.1016/j.artint.2013.11.004openalex-snapshot
The complexity of manipulative attacks in nearly single-peaked electorates
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.11.007openalex-snapshot
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00346-0openalex-snapshot
Monotone Boolean dualization is in co-NP[log2n]
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00037-0openalex-snapshot
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00343-7openalex-snapshot
The inapproximability of non-NP-hard optimization problems
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1093/logcom/exaf049openalex-snapshot
The logics for the complexity classes with limited non-determinism
inferred← citeshttps://doi.org/10.1109/ccc.1998.694601openalex-snapshot
Solving intractable problems with DNA computing
inferred← citeshttps://doi.org/10.1109/ccc.2000.856752openalex-snapshot
A separation of determinism, Las Vegas and nondeterminism for picture recognition
inferred← citeshttps://doi.org/10.1109/istcs.1993.253478openalex-snapshot
On fixed-parameter tractability and approximability of NP-hard optimization problems
inferred← citeshttps://doi.org/10.1109/istcs.1997.595152openalex-snapshot
A comparison of resource-bounded molecular computation models
inferred← citeshttps://doi.org/10.1109/sct.1993.336519openalex-snapshot
Computing functions with parallel queries to NP
inferred← citeshttps://doi.org/10.1109/sct.1993.336545openalex-snapshot
On limited nondeterminism and the complexity of the V-C dimension
inferred← citeshttps://doi.org/10.1109/sct.1994.315810openalex-snapshot
Downward separation fails catastrophically for limited nondeterminism classes
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743506openalex-snapshot
The minimum equivalent DNF problem and shortest implicants
inferred← citeshttps://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferred← citeshttps://doi.org/10.1137/s0097539793258295openalex-snapshot
On the Amount of Nondeterminism and the Power of Verifying
inferred← citeshttps://doi.org/10.1137/s0097539794277421openalex-snapshot
Downward Separation Fails Catastrophically for Limited Nondeterminism Classes
inferred← citeshttps://doi.org/10.1137/s009753979834388xopenalex-snapshot
Resource-Bounded Kolmogorov Complexity Revisited
inferred← citeshttps://doi.org/10.1145/2000378.2000406openalex-snapshot
The complexity of manipulative attacks in nearly single-peaked electorates
inferred← citeshttps://doi.org/10.1145/2540088openalex-snapshot
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2022.55openalex-snapshot
Superlinear Lower Bounds Based on ETH
inferred← citeshttps://doi.org/10.7155/jgaa.00107openalex-snapshot
An Efficient Algorithm for the Transversal Hypergraph Generation
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.