Applying Practice to Theory
Computational Complexity
2008-11-11 v1 Data Structures and Algorithms
Abstract
How can complexity theory and algorithms benefit from practical advances in computing? We give a short overview of some prior work using practical computing to attack problems in computational complexity and algorithms, informally describe how linear program solvers may be used to help prove new lower bounds for satisfiability, and suggest a research program for developing new understanding in circuit complexity.
Cite
@article{arxiv.0811.1305,
title = {Applying Practice to Theory},
author = {Ryan Williams},
journal= {arXiv preprint arXiv:0811.1305},
year = {2008}
}
Comments
16 pages, 1 figure; ACM SIGACT News, December 2008