On the public citation graph
The Closure of Monadic NP
0 signed · 64 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.1002/malq.19870330107openalex-snapshot
Second‐order and Inductive Definability on Finite Structures
inferredcites →https://doi.org/10.1002/malq.19970430402openalex-snapshot
Comparing the Power of Games on Graphs
inferredcites →https://doi.org/10.1006/inco.1995.1100openalex-snapshot
On Monadic NP vs Monadic co-NP
inferredcites →https://doi.org/10.1007/3-540-48168-0_24openalex-snapshot
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games
inferredcites →https://doi.org/10.1007/3-540-51498-8_23openalex-snapshot
Descriptive and computational complexity
inferredcites →https://doi.org/10.1007/3-540-58140-5_24openalex-snapshot
Arity vs. alternation in second order logic
inferredcites →https://doi.org/10.1007/3-540-60084-1_92openalex-snapshot
Graph Connectivity, Monadic NP and built-in relations of moderate degree
inferredcites →https://doi.org/10.1007/bfb0028030openalex-snapshot
The monadic quantifier alternation hierarchy over grids and pictures
inferredcites →https://doi.org/10.1016/0012-365x(84)90166-3openalex-snapshot
On the definability of properties of finite graphs
inferredcites →https://doi.org/10.1016/0020-0190(94)00219-oopenalex-snapshot
A note on the number of monadic quantifiers in monadic ∑11
inferredcites →https://doi.org/10.1016/0166-218x(92)90180-iopenalex-snapshot
P4-trees and substitution decomposition
inferredcites →https://doi.org/10.1016/0166-218x(94)90019-1openalex-snapshot
The monadic second order logic of graphs VI: on several representations of graphs by relational structures
inferredcites →https://doi.org/10.1016/0168-0072(95)00013-5openalex-snapshot
Arity and alternation in second-order logic
inferredcites →https://doi.org/10.1016/0168-0072(95)00030-5openalex-snapshot
On winning Ehrenfeucht games and monadic NP
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(76)90062-1openalex-snapshot
Complete sets and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0890-5401(91)90075-dopenalex-snapshot
On truth-table reducibility to SAT
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50020-4openalex-snapshot
MODEL-THEORETIC METHODS IN THE STUDY OF ELEMENTARY LOGIC
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72966-9openalex-snapshot
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
inferredcites →https://doi.org/10.1016/s0304-3975(96)00015-1openalex-snapshot
On winning strategies in Ehrenfeucht-Fraïssé games
inferredcites →https://doi.org/10.1109/lics.1997.614951openalex-snapshot
The monadic quantifier alternation hierarchy over graphs is infinite
inferredcites →https://doi.org/10.1109/sfcs.1993.366882openalex-snapshot
Logical reducibility and monadic NP
inferredcites →https://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferredcites →https://doi.org/10.2307/2274958openalex-snapshot
Reachability is harder for directed than for undirected finite graphs
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories
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.200310088openalex-snapshot
An Ehrenfeucht‐Fraïssé class game
inferred← citeshttps://doi.org/10.1006/inco.2002.2955openalex-snapshot
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs
inferred← citeshttps://doi.org/10.1007/11780342_52openalex-snapshot
Partially Ordered Connectives and ∑1 1 on Finite Models
inferred← citeshttps://doi.org/10.1007/11874683_32openalex-snapshot
On the Expressive Power of Graph Logic
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_31openalex-snapshot
A Toolkit for First Order Extensions of Monadic Games
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_24openalex-snapshot
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_12openalex-snapshot
Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_29openalex-snapshot
Biabduction (and Related Problems) in Array Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-322-84823-9_16openalex-snapshot
Dot-Depth and Monadic Quantifier Alternation over Pictures — Extended Abstract
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_93openalex-snapshot
On the Expressive Power of Monadic Least Fixed Point Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_10openalex-snapshot
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_27openalex-snapshot
Foundations for Decision Problems in Separation Logic with General Inductive Predicates
inferred← citeshttps://doi.org/10.1007/978-3-662-07003-1_7openalex-snapshot
Monadic Second-Order Logic and Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_18openalex-snapshot
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
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/j.jcss.2017.02.002openalex-snapshot
Parameterized complexity classes beyond para-NP
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.025openalex-snapshot
On the expressive power of monadic least fixed point logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00277-8openalex-snapshot
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00578-9openalex-snapshot
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
inferred← citeshttps://doi.org/10.1093/logcom/exaf045openalex-snapshot
The flattening operator in team-based logics
inferred← citeshttps://doi.org/10.1109/lics.2001.932492openalex-snapshot
The hierarchy inside closed monadic Σ/sub 1/ collapses on the infinite binary tree
inferred← citeshttps://doi.org/10.1145/1013560.1013562openalex-snapshot
Finite state machines for strings over infinite alphabets
inferred← citeshttps://doi.org/10.1145/1966357.1966366openalex-snapshot
Value joins are expensive over (probabilistic) XML
inferred← citeshttps://doi.org/10.1145/2500130openalex-snapshot
Static analysis and optimization of semantic web queries
inferred← citeshttps://doi.org/10.1145/3417759openalex-snapshot
On Existential MSO and Its Relation to ETH
inferred← citeshttps://doi.org/10.1145/3662158.3662774openalex-snapshot
A LOCAL View of the Polynomial Hierarchy
inferred← citeshttps://doi.org/10.1145/582475.582484openalex-snapshot
SIGACT news complexity theory comun 37
inferred← citeshttps://doi.org/10.1145/876638.876642openalex-snapshot
Definable relations and first-order query languages over strings
inferred← citeshttps://doi.org/10.2178/jsl/1080938831openalex-snapshot
First order quantifiers in monadic second order logic
inferred← citeshttps://doi.org/10.3233/sw-2012-0076openalex-snapshot
Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries
inferred← citeshttps://doi.org/10.3390/a12090188openalex-snapshot
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1672openalex-snapshot
The Parameterized Complexity of Reasoning Problems Beyond NP
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.