Another look at the phenomenon of phase transition

DOI10.1080/09528130500128235zbMath1101.68843OpenAlexW2003961104MaRDI QIDQ5704529

Eliezer L. Lozinskii

Publication date: 15 November 2005

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528130500128235

zbMATH Keywords

random graphsinteger partitionspropositional satisfiability3-satmonotone qualitative changes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• A threshold for unsatisfiability
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• A complete anytime algorithm for number partitioning
• Resolving contradictions: A plausible semantics for inconsistent systems
• Exploiting the deep structure of constraint problems
• Phase transition and finite-size scaling for the integer partitioning problem
• Sharp thresholds of graph properties, and the $k$-sat problem
• Information and evidence in logic systems
• Consistent subsets of inconsistent systems: structure and behaviour
• Every monotone graph property has a sharp threshold
• Random constraint satisfaction: A more accurate picture
• Random constraint satisfaction: Flaws and structure
• Statistical mechanics methods and phase transitions in optimization problems
• A physicist's approach to number partitioning
• Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs

This page was built for publication: Another look at the phenomenon of phase transition