Skip to main content
University of Oxford Department of Computer Science
  Contact Us     Search  
  1. Home
  2. Research
  3. Algorithms and Complexity Theory
  4. A complete characterization of complexity for Boolean constraint optimization problems

A complete characterization of complexity for Boolean constraint optimization problems

David Cohen‚ Martin Cooper and Peter Jeavons

Book Title
Proceedings of CP'04
Number
3258
Pages
212–226
Series
Lecture Notes in Computer Science
Year
2004

Links

See Also

Back to Top