Explaining the Ubiquity of Phase Transitions in Decision Problems
Andrew Jackson

TL;DR
This paper introduces an analytical method to identify phase transitions in a broad class of decision problems, including practical and intractable cases, without extensive computational analysis.
Contribution
It provides a novel analytic framework to establish phase transitions in decision problems, expanding understanding beyond computational experiments.
Findings
Large set of decision problems exhibit phase transitions
Method applies to practical and intractable problems
No extensive computation needed for analysis
Abstract
I present an analytic approach to establishing the presence of phase transitions in a large set of decision problems. This approach does not require extensive computational study of the problems considered. The set -- that of all paddable problems over even-sized alphabets satisfying a condition similar to not being sparse -- shown to exhibit phase transitions contains many "practical" decision problems, is very large, and also contains extremely intractable problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Artificial Intelligence in Games
