DP-Complete Problems Derived from Extremal NP-Complete Properties (Q3182925): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1598867843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of unfrozen problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of non-unique probe selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact complexity of exact-four-colorability / rank
 
Normal rank

Latest revision as of 02:13, 2 July 2024

scientific article
Language Label Description Also known as
English
DP-Complete Problems Derived from Extremal NP-Complete Properties
scientific article

    Statements

    DP-Complete Problems Derived from Extremal NP-Complete Properties (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2009
    0 references
    DP-complete
    0 references
    complexity
    0 references
    extremal problem
    0 references
    colorability
    0 references
    implicant
    0 references
    unfrozen
    0 references

    Identifiers