Phase transitions and the search problem
type: Item
instance of: scholarly article
title: Phase transitions and the search problem
DOI: 10.1016/0004-3702(95)00044-5
author: Tad Hogg
author: Bernardo A. Huberman
author: Colin P. Williams
published in: Artificial Intelligence
publication date: 2022-09-22T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 7589954
zbMATH Keywords: search
zbMATH Keywords: phase transitions
zbMATH Keywords: constraint satisfaction
MaRDI profile type: MaRDI publication profile
full work available at URL: 0004-3702(95)00044-5
OpenAlex ID: W2039557216
cites work: Q3682518
cites work: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
cites work: Q4012216
cites work: Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
cites work: Some Cluster Size and Percolation Problems
cites work: Q4198056
cites work: Easy problems are sometimes hard
cites work: Q4386943
cites work: The hardest constraint problems: A double phase transition
cites work: Q4079017
cites work: A Parallel Graph Coloring Heuristic
cites work: Searching for an optimal path in a tree with random costs
cites work: Optimization by Simulated Annealing
cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions
cites work: Q4845469
cites work: Q4012185
cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
cites work: Q3932310
cites work: An empirical study of phase transitions in binary constraint satisfaction problems
cites work: The average complexity of depth-first search with backtracking and cutoff
cites work: Exploiting the deep structure of constraint problems
description: scientific article; zbMATH DE number 7589954