homeresources & publications › complexity of continuous, 3-sat-like constraint satisfaction problems

TECHNICAL PUBLICATIONS:

Complexity of continuous, 3-SAT-like constraint satisfaction problems

 

This paper presents and discusses preliminary work in complexity analysis of continuous constraint satisfaction problems, building on well-known complexity analysis for discrete constraint satisfaction problems. The complexities of several algorithms and problem formulations are analyzed and compared.

 
citation

Shang, Y. ; Fromherz, M. P. J. ; Hogg, T. H. ; Jackson, W. B. Complexity of continuous, 3-SAT-like constraint satisfaction problems. IJCAI'01 Workshop on Stochastic Search Algorithms; 2001 August 6; Seattle, WA.