A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Grid intersection graphs and boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On grid intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of curves in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the thickness of graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of Thin Film RC Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127571235 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(94)90143-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085486788 / rank
 
Normal rank

Latest revision as of 12:17, 30 July 2024

scientific article
Language Label Description Also known as
English
A special planar satisfiability problem and a consequence of its NP- completeness
scientific article

    Statements

    A special planar satisfiability problem and a consequence of its NP- completeness (English)
    0 references
    0 references
    27 September 1994
    0 references
    NP-complete satisfiability
    0 references
    intersection graphs
    0 references

    Identifiers