Back to Results
First PageMeta Content
Automated theorem proving / NP-complete problems / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Resolution / Unit propagation / Constraint satisfaction / Theoretical computer science / Mathematics / Applied mathematics


The Phase Transition in Exact Cover Vamsi Kalapala∗ and Cristopher Moore∗,† {vamsi,moore}@cs.unm.edu, ∗ Department of Computer Science, University of New Mexico
Add to Reading List

Document Date: 2008-10-23 11:39:06

Open Document

File Size: 123,91 KB

Share Result on Facebook

/

Facility

Santa Fe Institute / University of New Mexico / /

IndustryTerm

list coloring algorithm / greedy satisfiability algorithm / lower bound using algorithms / greedy algorithm / quantum adiabatic evolution algorithm / quantum adiabatic algorithm / adiabatic quantum algorithm / /

Organization

University of New Mexico / Santa Fe Institute / National Science Foundation / Department of Computer Science / /

Person

Sahar Abubucker / Arthur Chtcherba / Min Li / Cristopher Moore / S. Knysh / V / /

ProvinceOrState

South Carolina / New Mexico / /

PublishedMedium

Theoretical Computer Science / /

Technology

ESA / lower bound using algorithms / Quantum algorithm / quantum adiabatic evolution algorithm / adiabatic quantum algorithm / quantum adiabatic algorithm / list coloring algorithm / greedy satisfiability algorithm / /

SocialTag