On the public citation graph

Monadic logical definability of NP-complete problems

https://doi.org/10.1007/bfb0022256
0 signed · 29 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.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1006/inco.1994.1100openalex-snapshot
Logical Definability of NP Optimization Problems
inferredcites →https://doi.org/10.1007/3-540-51237-3_10openalex-snapshot
Nearly linear time
inferredcites →https://doi.org/10.1007/3-540-51498-8_23openalex-snapshot
Descriptive and computational complexity
inferredcites →https://doi.org/10.1007/3-540-56992-8_16openalex-snapshot
Linear time algorithms and NP-complete problems
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01276438openalex-snapshot
The quantifier structure of sentences that characterize nondeterministic time complexity
inferredcites →https://doi.org/10.1007/bf01786976openalex-snapshot
Complexity classes and theories of finite models
inferredcites →https://doi.org/10.1007/bfb0099486openalex-snapshot
Toward logic tailored for computational complexity
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1093/comjnl/9.1.15openalex-snapshot
Computer and Information Sciences
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1137/0217050openalex-snapshot
A Natural NP-Complete Problem with a Nontrivial Lower Bound
inferredcites →https://doi.org/10.1137/0219028openalex-snapshot
A Nontrivial Lower Bound for an NP Problem on Automata
inferredcites →https://doi.org/10.1142/s0129054190000217openalex-snapshot
ON THE NOTION OF LINEAR TIME COMPUTABILITY
inferredcites →https://doi.org/10.1145/322047.322060openalex-snapshot
Satisfiability Is Quasilinear Complete in NQL
inferredcites →https://doi.org/10.1145/800061.808765openalex-snapshot
Languages which capture complexity classes
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19970430315openalex-snapshot
Rudimentary Languages and Second‐Order Logic
inferred← citeshttps://doi.org/10.1007/10703163_2openalex-snapshot
Descriptive Complexity, Lower Bounds and Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_23openalex-snapshot
MonadicNLIN and Quantifier-Free Reductions
inferred← citeshttps://doi.org/10.1007/bf02127798openalex-snapshot
Sorting, linear time and the satisfiability problem
inferred← citeshttps://doi.org/10.1007/bfb0023481openalex-snapshot
Algebraic and logical characterizations of deterministic linear time classes
inferred← citeshttps://doi.org/10.1007/bfb0028031openalex-snapshot
Padding and the expressive power of existential second-order logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.05.014openalex-snapshot
Fragments of Monadic Second-Order Logics Over Word Structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00133-6openalex-snapshot
A descriptive complexity approach to the linear hierarchy
inferred← citeshttps://doi.org/10.1093/logcom/8.2.135openalex-snapshot
Computation of prime implicants using matrix and paths
inferred← citeshttps://doi.org/10.1137/s0097539799360240openalex-snapshot
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
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.