On unique graph 3-colorability and parsimonious reductions in the plane (Q596079): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2004.02.003 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037855784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all solutions of generalized satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time transformations between combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, linear time and the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Planar Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Enumeration Problems in Geometry and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2004.02.003 / rank
 
Normal rank

Latest revision as of 21:49, 9 December 2024

scientific article
Language Label Description Also known as
English
On unique graph 3-colorability and parsimonious reductions in the plane
scientific article

    Statements

    On unique graph 3-colorability and parsimonious reductions in the plane (English)
    0 references
    0 references
    10 August 2004
    0 references
    Computational complexity
    0 references
    Planar combinatorial problems
    0 references
    3-Colorability
    0 references
    Unique solution problems
    0 references
    Parsimonious equivalence to SAT
    0 references

    Identifiers