Typical case complexity and phase transitions. Papers from the workshop, Ottawa, ON, Canada, May 14--16, 2003

zbMATH Open1109.68315MaRDI QIDQ878331FDOQ878331

Author name not available (Why is that?)

Publication date: 26 April 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Phase transitions of EXPSPACE-complete problems: a further step 👍 👎
• PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS 👍 👎
• Determining computational complexity from characteristic ‘phase transitions’ 👍 👎
• Complexity theory. Abstracts from the workshop held June 24--30, 2007. 👍 👎
• Complexity-theoretic models of phase transitions in search problems 👍 👎
• Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem 👍 👎
• Complexity, scaling, and a phase transition 👍 👎

This page was built for publication: Typical case complexity and phase transitions. Papers from the workshop, Ottawa, ON, Canada, May 14--16, 2003

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878331)