Computer ScienceMathematics

Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

C. Gomes, B. Selman, N. Crato, Henry A. Kautz

2000.2.1JOURNAL OF AUTOMATED REASONING

DOI: 10.1023/a:1006314320276

tlooto Summary

It is shown that these runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction are best characterized by a general class of distributions that can have infinite moments (i.e., an infinite mean, variance, etc.).

Abstract

Abstract is not available.

Citation format

GOMES, C., et al. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. JOURNAL OF AUTOMATED REASONING, 2000, 24: 67–100.