Back to Results
First PageMeta Content
NP-complete problems / Boolean satisfiability problem / NP-complete / Satisfiability / Maximum cut / Algorithm / Graph coloring / 2-satisfiability / Theoretical computer science / Mathematics / Applied mathematics


BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science
Add to Reading List

Document Date: 2005-04-05 15:07:30

Open Document

File Size: 799,04 KB

Share Result on Facebook

Country

Germany / Denmark / /

/

Facility

Computer Science University of Aarhus / Computer Science University of Aarhus Ny Munkegade / University of Aarhus / Computer Science University of Aarhus Denmark Exact Algorithms / /

IndustryTerm

programs generating algorithms / /

Organization

Faculty of Science / Aarhus Climbing Club / Max Planch Institut f¨ / University of Aarhus / BRICS Department / Computer Science University of Aarhus Ny Munkegade / Computer Science University / Lunch Club / Bjarke Skjernaa PhD Dissertation Department / /

Person

Peter Bro Miltersen / Bjarke Skjernaa / Sven Skyum / Sylvain Pion / /

/

ProgrammingLanguage

C / /

Technology

programs generating algorithms / /

URL

ftp /

SocialTag