Probabilistic algorithm for k-SAT and constraint satisfaction problems

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 410-414

  Schoening, Uwe ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

CONSTRAINT SATISFACTION PROBLEMS; POLYNOMIAL FACTOR; PROBABILISTIC ALGORITHM;

ALGORITHMS;

EID: 0033331493     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)