On the complexity of unfrozen problems (Q2581544): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Joseph C. Culberson / rank
Normal rank
 
Property / author
 
Property / author: Joseph C. Culberson / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
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.1016/j.dam.2005.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2156111468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frozen development in graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230728 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:56, 11 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of unfrozen problems
scientific article

    Statements

    On the complexity of unfrozen problems (English)
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Frozen complexity
    0 references
    NP-completeness
    0 references
    Graph coloring
    0 references
    Satisfiability
    0 references
    Hamiltonian cycle
    0 references
    Subgraph isomorphism
    0 references
    0 references