Applying Practice to Theory

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
16 pages, 1 figure; ACM SIGACT News, December 2008

Keywords

Computational Complexity, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/173741

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0811.1305
 http://arxiv.org/abs/0811.1305

Collections

arXiv