Relaxation in constraint satisfaction problems
Licentiate thesis, 1999

computational complexity

spin glasses

graph colouring

NP-completeness

relaxation

boolean satisfiability

Author

Pontus Svenson

Department of Theoretical Physics

Subject Categories

Physical Sciences

More information

Created

10/7/2017

Feedback and support

If you have questions, need help, find a bug or just want to give us feedback you may use this form, or contact us per e-mail research.lib@chalmers.se or by phone 46 (0)31-772 3744.

About

Research.chalmers.se contains research information from Chalmers University of Technology, Sweden. It includes information on projects, publications, research funders and collaborations.

More about coverage period and what is publicly available

Privacy and cookies

Links

Chalmers Library
Chalmers Research
Research projects at chalmers.se

Chalmers University of Technology

SE-412 96 GOTHENBURG, SWEDEN
PHONE: +46 (0)31-772 10 00
WWW.CHALMERS.SE