On the complexity of unfrozen problems (Q2581544): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
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 |
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
10 January 2006
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