Applying Practice to Theory [article]

Ryan Williams
2008 arXiv   pre-print
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.
arXiv:0811.1305v1 fatcat:wngu2dipivcingv5kx2atojgc4