On the public citation graph
Hierarchies of complete problems
0 signed · 58 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/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1016/s0022-0000(69)80012-7openalex-snapshot
Checking automata and one-way stack languages
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1038/scientificamerican1070-120openalex-snapshot
Mathematical Games
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1145/1811129.1811131openalex-snapshot
On some direct encodings of nondeterministic Turing machines operating in polynomial time into p-complete problems
inferredcites →https://doi.org/10.1145/321978.321989openalex-snapshot
A Combinatorial Problem Which Is Complete in Polynomial Space
inferredcites →https://doi.org/10.1145/800116.803754openalex-snapshot
A combinatorial problem which is complete in polynomial space
inferredcites →https://doi.org/10.1145/800119.803883openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1145/800119.803884openalex-snapshot
Some simplified NP-complete problems
inferredcites →https://doi.org/10.1145/800119.803889openalex-snapshot
Computational complexity of probabilistic Turing machines
inferredcites →https://doi.org/10.1145/800119.803891openalex-snapshot
Comparison of polynomial-time reducibilities
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1145/800125.804032openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
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-08353-7_136openalex-snapshot
Properties of complexity classes a short survey
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_39openalex-snapshot
The complexity of decision problems for finite-turn multicounter machines
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/978-3-030-23679-3_18openalex-snapshot
Decision Problems for Restricted Variants of Two-Dimensional Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-38100-3_4openalex-snapshot
Computational Complexity of Reversible Reaction Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_22openalex-snapshot
Decision Problems for Reversible and Permutation Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_13openalex-snapshot
Counting Abstraction and Decidability for the Verification of Structured Parameterized Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-40946-7_8openalex-snapshot
Problems on Finite Automata and the Exponential Time Hypothesis
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_25openalex-snapshot
A Pattern Logic for Automata with Outputs
inferred← citeshttps://doi.org/10.1007/978-3-322-80139-5_6openalex-snapshot
Sequentielle Komplexitätsklassen
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_3openalex-snapshot
Descriptional and Computational Complexity of Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_4openalex-snapshot
The Complexity of Intersecting Finite Automata Having Few Final States
inferred← citeshttps://doi.org/10.1007/bf00289308openalex-snapshot
?-productions in context-free grammars
inferred← citeshttps://doi.org/10.1007/bfb0016267openalex-snapshot
An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
inferred← citeshttps://doi.org/10.1007/s00037-014-0089-9openalex-snapshot
The complexity of intersecting finite automata having few final states
inferred← citeshttps://doi.org/10.1007/s00224-018-9874-1openalex-snapshot
A Logic for Document Spanners
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90063-4openalex-snapshot
Endmarkers can make a difference
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90028-3openalex-snapshot
The complexity of decision problems for finite-turn multicounter machines
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90005-5openalex-snapshot
An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90092-5openalex-snapshot
The maximum flow problem is log space complete for P
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90015-topenalex-snapshot
Iterated stack automata and complexity classes
inferred← citeshttps://doi.org/10.1016/b978-0-12-708240-0.50011-3openalex-snapshot
Automata Theory for Database Theoreticians*†*Theoretician: 1. One who theorizes. 2. One who bases practice on theory. (From Webster's 3rd Int'l Dictionary, 1961.)†An earlier and shorter version of this paper appeared in Proc. 8th ACM Symp. on Principles of Database Systems, 1989, pp. 83–92
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.013openalex-snapshot
Descriptional and computational complexity of finite automata—A survey
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.11.003openalex-snapshot
A parametric analysis of the state-explosion problem in model checking
inferred← citeshttps://doi.org/10.1016/j.tcs.2002.11.002openalex-snapshot
Assembling molecules in ATOMIX is hard
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.028openalex-snapshot
Decision problems and projection languages for restricted variants of two-dimensional automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(81)80003-5openalex-snapshot
The complexity of the equivalence problem for two characterizations of presburger sets
inferred← citeshttps://doi.org/10.1109/sfcs.1976.35openalex-snapshot
Variations of a new machine model
inferred← citeshttps://doi.org/10.1142/s0129054120410038openalex-snapshot
A Pattern Logic for Automata with Outputs
inferred← citeshttps://doi.org/10.1145/73721.73729openalex-snapshot
Invited talk: automata theory for database theoreticians
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25776openalex-snapshot
Model-Checking for Ability-Based Logics with Constrained Plans
inferred← citeshttps://doi.org/10.18255/1818-1015-2013-6-36-51openalex-snapshot
A Formal Model and Verification Problems for Software Defined Networks
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:33)2019openalex-snapshot
The Complexity of Flat Freeze LTL
inferred← citeshttps://doi.org/10.3103/s0146411614070165openalex-snapshot
A formal model and verification problems for software defined networks
inferred← citeshttps://doi.org/10.3390/a10010024openalex-snapshot
Problems on Finite Automata and the Exponential Time Hypothesis
inferred← citeshttps://doi.org/10.48550/arxiv.2108.05244openalex-snapshot
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited
inferred← citeshttps://doi.org/10.5860/choice.47-3219openalex-snapshot
Games, puzzles, and computation
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.