18. CCC 2003:
Aarhus, Denmark Session 1
export record as
dblp key:
export record as
dblp key:
Session 2
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Session 3
export record as
dblp key:
Pranab Sen :
Lower bounds for predecessor searching in the cell probe model.
73-83
export record as
dblp key:
Detlef Sieling :
Minimization of Decision Trees Is Hard to Approximate.
84-92
export record as
dblp key:
Session 4
export record as
dblp key:
conf/coco/ChakrabartiKS03 export record as
dblp key:
Hartmut Klauck :
Rectangle Size Bounds and Threshold Covers in Communication Complexity.
118-134
export record as
dblp key:
Session 6
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Session 7
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Session 8
export record as
dblp key:
export record as
dblp key:
Invited Talk
export record as
dblp key:
Johan Håstad :
Inapproximability Some history and some open problems.
265-
Session 10
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Session 11
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Invited Talk
export record as
dblp key:
Manindra Agrawal :
On Derandomizing Tests for Certain Polynomial Identities.
355-
Session 13
export record as
dblp key:
Oded Regev :
Improved Inapproximability of Lattice and Coding Problems with Preprocessing.
363-370
export record as
dblp key:
export record as
dblp key:
data released under the ODC-BY 1.0 license
