A Space-Efficient Randomized DNA Algorithm for k-SAT
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
| Hi-index | 0.00 |