On the public citation graph
Nondeterminism within P
0 signed · 25 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-51498-8_2openalex-snapshot
Complexity classes with complete problems between P and NP-C
inferredcites →https://doi.org/10.1016/0020-0190(88)90152-4openalex-snapshot
Short propositional formulas represent nondeterministic computations
inferredcites →https://doi.org/10.1016/0304-3975(92)00014-iopenalex-snapshot
Nondeterministic circuits, space complexity and quasigroups
inferredcites →https://doi.org/10.1109/sfcs.1989.63480openalex-snapshot
On the complexity of fixed parameter problems
inferredcites →https://doi.org/10.1137/0209003openalex-snapshot
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
inferredcites →https://doi.org/10.1137/0219003openalex-snapshot
The Complexity of Very Simple Boolean Formulas with Applications
inferredcites →https://doi.org/10.1145/322047.322060openalex-snapshot
Satisfiability Is Quasilinear Complete in NQL
inferredcites →https://doi.org/10.31274/rtd-180813-10619openalex-snapshot
On the structure of intractable sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_33openalex-snapshot
The emptiness problem for intersections of regular languages
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_16openalex-snapshot
Linear time algorithms and NP-complete problems
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/978-3-030-26176-4_27openalex-snapshot
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems
inferred← citeshttps://doi.org/10.1109/aiccsa.2005.1387015openalex-snapshot
Fast, effective vertex cover kernelization: a tale of two algorithms
inferred← citeshttps://doi.org/10.1109/ccgrid.2003.1199354openalex-snapshot
A parallel FPT application for clusters
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/sct.1992.215379openalex-snapshot
Fixed-parameter intractability
inferred← citeshttps://doi.org/10.1109/sct.1994.315810openalex-snapshot
Downward separation fails catastrophically for limited nondeterminism classes
inferred← citeshttps://doi.org/10.1109/sct.1995.514727openalex-snapshot
On superlinear lower bounds in complexity theory
inferred← citeshttps://doi.org/10.1137/s0097539791223206openalex-snapshot
Linear Time Algorithms and NP-Complete Problems
inferred← citeshttps://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferred← citeshttps://doi.org/10.1587/transcom.2020ebp3006openalex-snapshot
Algorithms for Distributed Server Allocation Problem
inferred← citeshttps://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness 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.