Computer Science – Computational Complexity
Scientific paper
2008-11-09
Computer Science
Computational Complexity
16 pages, 1 figure; ACM SIGACT News, December 2008
Scientific paper
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.
No associations
LandOfFree
Applying Practice to Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Applying Practice to Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applying Practice to Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-483884