Polynomial-average-time satisfiability problems (Q1095678): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0255(87)90003-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1995067748 / rank | |||
Normal rank |
Latest revision as of 10:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial-average-time satisfiability problems |
scientific article |
Statements
Polynomial-average-time satisfiability problems (English)
0 references
1987
0 references
Let p(v) be the probability for any of 2v literals (formed from v variables) to appear in a clause, t(v) be the number of clauses in a random predicate. The average time for determining satisfiability using backtracking is investigated. It takes polynomial average time if lim vp(v)\(=0\), t(v)\(\geq (\ln 2+\epsilon)v/(-\ln ((v+1)p(v)))\) or if lim vp(v)\(=\infty\), lim p(v)\(=0\), t(v)\(\geq ((\ln 2+\epsilon)/\exp (v))\exp (2vp(v))\); the intermediate cases are also covered.
0 references
random predicate
0 references
average time
0 references
satisfiability
0 references
backtracking
0 references
0 references