Satisfiability of co-nested formulas (Q1323332): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of induced minors and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank

Latest revision as of 14:46, 22 May 2024

scientific article
Language Label Description Also known as
English
Satisfiability of co-nested formulas
scientific article

    Statements

    Satisfiability of co-nested formulas (English)
    0 references
    0 references
    0 references
    2 June 1994
    0 references
    decidability
    0 references
    satisfiability
    0 references
    co-nested formulas
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references