18. CCC 2003:
Aarhus, Denmark
18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark.
IEEE Computer Society 2003, ISBN 0-7695-1879-6
Session 1
Session 2
Session 3
Session 4
Session 6
Session 7
Session 8
Invited Talk
- Johan Håstad:
Inapproximability Some history and some open problems.
265-

Session 10
Session 11
Invited Talk
- Manindra Agrawal:
On Derandomizing Tests for Certain Polynomial Identities.
355-

Session 13
- Oded Regev:
Improved Inapproximability of Lattice and Coding Problems with Preprocessing.
363-370

- Jonas Holmerin, Subhash Khot:
A Strong Inapproximability Gap for a Generalization of Minimum Bisection.
371-378

- Subhash Khot, Oded Regev:
Vertex Cover Might be Hard to Approximate to within 2-\varepsilon.
379-

Last update Sat May 18 18:17:09 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page