default search action
Discrete Applied Mathematics, Volume 153
Volume 153, Numbers 1-3, 1 December 2005
- Lefteris M. Kirousis, Evangelos Kranakis
:
Special Issue on Typical Case Complexity and Phase Transitions. 1 - Adam Beacham, Joseph C. Culberson:
On the complexity of unfrozen problems. 3-24 - Paul Beame
The resolution complexity of random graph k-colorability. 25-47 - Nadia Creignou, Hervé Daudé, John V. Franco:
A sharp threshold for the renameable-Horn and the q-Horn properties. 48-57 - Tassos Dimitriou:
SAT distributions with planted assignments and phase transitions between decision and optimization problems. 58-72 - András Faragó:
On the typical case complexity of graph optimization. 73-88 - John V. Franco:
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon. 89-123 - Yong Gao, Joseph C. Culberson:
Resolution complexity of random constraint satisfaction problems: Another half of the story. 124-140 - Gabriel Istrate:
Threshold properties of random boolean constraint satisfaction problems. 141-152 - Ulrich Voll:
A novel giant-subgraph phase-transition in sparse random k-partite graphs. 153-181
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: