Applying practice to theory

Authors:
Ryan Williams
Affiliations:
Carnegie Mellon University
Venue:
ACM SIGACT News
Year:
2008

Citing 28
Cited 2

Short propositional formulas represent nondeterministic computations

Information Processing Letters
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Oracles and queries that are sufficient for exact learning

Journal of Computer and System Sciences
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Satisfiability Is Quasilinear Complete in NQL

Journal of the ACM (JACM)
Gadgets, Approximation, and Linear Programming

SIAM Journal on Computing
Explicit lower bound of 4.5n - o(n) for boolena circuits

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results

Journal of the ACM (JACM)
Computer assisted proof of optimal approximability results

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Solution of the Robbins Problem

Journal of Automated Reasoning
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A hierarchy for nondeterministic time complexity

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Improved upper bounds for 3-SAT

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Algorithmica
Toward a Model for Backtracking and Dynamic Programming

CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Time-space lower bounds for satisfiability

Journal of the ACM (JACM)
A new approach to proving upper bounds for MAX-2-SAT

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms

ACM Transactions on Algorithms (TALG)
A survey of lower bounds for satisfiability and related problems

Foundations and Trends® in Theoretical Computer Science
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

Computational Complexity
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
sKizzo: a suite to evaluate and certify QBFs

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Linear-programming design and analysis of fast algorithms for Max 2-CSP

Discrete Optimization

Finding Efficient Circuits Using SAT-Solvers

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Optimization principles for arithmetic functions in hardware-software co-design

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

How can complexity theory and algorithms benefit from practical advances in computing? We give an 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.