Tree-width and the monadic quantifier hierarchy. (Q1401360): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Johann A. Makowsky / rank
Normal rank
 
Property / author
 
Property / author: Johann A. Makowsky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Defining a Relation on a Finite Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / 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: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic generalized spectra / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is the evaluation of conjunctive queries tractable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / 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: ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the models of decidable monadic theories of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free grammars as a tool for describing polynomial-time subclasses of hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00449-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093898714 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:28, 30 July 2024

scientific article
Language Label Description Also known as
English
Tree-width and the monadic quantifier hierarchy.
scientific article

    Statements

    Tree-width and the monadic quantifier hierarchy. (English)
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    Parametrized complexity
    0 references
    Polynomial hierarchy
    0 references
    Monadic second-order logic
    0 references
    Tree-width
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers