The closure of monadic NP (Q1577017): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Reachability is harder for directed than for undirected finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On winning strategies in Ehrenfeucht-Fraïssé games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subclasses of binary NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order and Inductive Definability on Finite Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic generalized spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing the Power of Games on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monadic NP vs monadic co-NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arity and alternation in second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Connectivity, Monadic NP and built-in relations of moderate degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On winning Ehrenfeucht games and monadic NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ 4\)-trees and substitution decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definability of properties of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank

Revision as of 12:31, 30 May 2024

scientific article
Language Label Description Also known as
English
The closure of monadic NP
scientific article

    Statements

    The closure of monadic NP (English)
    0 references
    27 August 2000
    0 references
    closed monadic NP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers