Entropy of theK-Satisfiability Problem
type: Item
instance of: scholarly article
title: Entropy of theK-Satisfiability Problem
zbMATH Open document ID: 1042.82567
author: Riccardo Zecchina
author: R. Monasson
published in: Physical Review Letters
publication date: 2000-07-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/cond-mat/9603014
full work available at URL: p3881
Mathematics Subject Classification ID: 82B44
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 1477745
MaRDI profile type: Publication
Wikidata QID: Q74567747
arXiv ID: cond-mat/9603014
cites work: Optimization by Simulated Annealing
cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions
cites work: Tail bounds for occupancy and the satisfiability threshold conjecture
cites work: Counting the number of solutions for instances of satisfiability
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
OpenAlex ID: W2158907280
DOI: 10.1103/PHYSREVLETT.76.3881
Recommended article: Q4437609
Recommended article: The Complexity of Approximating the Entropy
Recommended article: Kolmogorov entropy in the context of computability theory
Recommended article: A note on Kolmogorov complexity and entropy
Recommended article: Q4681318
Recommended article: Entropy measures vs. Kolmogorov complexity
Recommended article: Entropy and the complexity of graphs revisited
Recommended article: Entropic exercises around the Kneser–Poulsen conjecture
Recommended article: Entropy and the combinatorial dimension
Recommended article: An entropy proof of the Kahn-Lovász theorem
description: scientific article; zbMATH DE number 1477745