Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
type: Item
instance of: scholarly article
title: Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
zbMATH Open document ID: 0994.68071
DOI: 10.1016/S0378-4371(02)00516-2
author: Giulio Biroli
author: Simona Cocco
author: R. Monasson
published in: Physica A
publication date: 2002-05-02T00:00:00Z
Mathematics Subject Classification ID: 68Q19
zbMATH DE Number: 1736946
zbMATH Keywords: critical phenomena
zbMATH Keywords: resolution times
zbMATH Keywords: out-of-equilibrium systems
MaRDI profile type: Publication
cites work: Q4198056
cites work: Determining computational complexity from characteristic ‘phase transitions’
cites work: Q4237477
cites work: Statistical mechanics methods and phase transitions in optimization problems
cites work: Entropy of theK-Satisfiability Problem
cites work: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
Recommended article: Phase transitions of random constraint satisfaction problems
Recommended article: Q4252413
Recommended article: The phase transition in random horn satisfiability and its algorithmic implications
Recommended article: Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
Recommended article: On the phase transitions of random \(k\)-constraint satisfaction problems
Recommended article: Q4954175
Recommended article: Q3972641
Recommended article: Phase transition in a random fragmentation problem with applications to computer science
Recommended article: Statistical physics of random CSPs (tutorial)
description: scientific article; zbMATH DE number 1736946