Applying Practice to Theory

Simple item page
dc.creatorWilliams, Ryan
dc.date2008-11-09
dc.date.accessioned2026-07-07T10:17:06Z
dc.date.available2026-07-07T10:17:06Z
dc.descriptionHow 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.
dc.description16 pages, 1 figure; ACM SIGACT News, December 2008
dc.identifierhttps://arxiv.org/abs/0811.1305
dc.identifierhttp://arxiv.org/abs/0811.1305
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173741
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.titleApplying Practice to Theory
dc.typetext

Files

Collections

arXiv