|
||||||||||||
|
||||||||||||
|
|
Home » Computer Sciences » Computer Science Theoretical » Complexity Science Theory » Complexity Theory By People » Moshe Y Vardi Moshe Y Vardi in Computer Engineering Resources Directory |
Recent paper on the hardness of random formulas for SAT solver; bounded treewidth.
Address: Mail Stop 132, Rice University, 6100 S. Main Street, Houston, TX 77005-1892
Telephone: 713-348-5977
Fax: 713-348-5930
Website: http://www.cs.rice.edu/~vardi/
Sponsored Links

