| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Ryan Williams Ryan Williams: A New Algorithm for Optimal Constraint Satisfaction and Its Implications. ICALP 2004 : 1227-1237 Adam Meyerson , Ryan Williams: On the Complexity of Optimal K-Anonymity. PODS 2004 : 223-228 Ryan Williams: A new algorithm for optimal constraint satisfaction and its implications Electronic Colloquium on Computational Complexity (ECCC) (032): (2004) Ryan Williams, Carla P. Gomes , Bart Selman : Backdoors To Typical Case Complexity. IJCAI 2003 : 1173-1178 Ryan Williams: On Computing k-CNF Formula Properties. SAT 2003 : 330-340 Ryan Williams: Algorithms for quantified Boolean formulas. SODA 2002 : 299-307 1 [ 3 ] 2 [ 5 ] 3 [ 3 ]  ©2005 Association for Computing Machinery |
