Applying Practice to Theory release_wngu2dipivcingv5kx2atojgc4

by Ryan Williams

Released as a article .

2008  

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.
In text/plain format

Archived Files and Locations

application/pdf  230.1 kB
file_ud3wsy33ybf5pgb2vfma5i7s7y
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2008-11-09
Version   v1
Language   en ?
arXiv  0811.1305v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 97254e5b-176f-49d4-984e-d96a47bf661c
API URL: JSON