---

Add URL

My Sites

My Account

Contact Us

Search only in Research Interests   Search the Web

 Home » Computer Science » Theoretical » Complexity Theory » People » Research Interests

Web Pages    1 - 5   {5}

1 - Moshe Y. Vardi   Recent paper on the hardness of random formulas for SAT solver; bounded tree-width http://www.cs.rice.edu/~vardi/   [more pages from this URL]     2 - Per Bjesse   SAT-based hardware verification (using Stalmarck's algorithm) http://www.cs.chalmers.se/~bjesse/   [more pages from this URL]     3 - Alan Frisch   Artificial Intelligence, constraint satisfaction problems http://www-users.cs.york.ac.uk/~frisch/   [more pages from this URL]     4 - John Franco   (probabilistic analysis of algorithms, polynomial time solvable subclasses of satisfiability) http://www.ece.uc.edu/~franco/   [more pages from this URL]     5 - Hector Levesque   Local search, random SAT, artificial intelligence http://www.cs.utoronto.ca/DCS/People/Faculty/hector.html   [more pages from this URL]

E-Mail Add URL