Emanuele Viola Hardness vs. Randomness within Alternating Time. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:53-0 [Conf]

Pranab Sen Lower bounds for predecessor searching in the cell probe model. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:73-83 [Conf]

Detlef Sieling Minimization of Decision Trees Is Hard to Approximate. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:84-92 [Conf]

Andrei E. Romashchenko Extracting the Mutual Information for a Triple of Binary Strings. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:221-229 [Conf]

Wolfgang Merkle The complexity of stochastic sequences. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:230-0 [Conf]

Johan Håstad Inapproximability Some history and some open problems. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:265-0 [Conf]

Manindra Agrawal On Derandomizing Tests for Certain Polynomial Identities. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:355-0 [Conf]

Oded Regev Improved Inapproximability of Lattice and Coding Problems with Preprocessing. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:363-370 [Conf]

Jonas Holmerin, Subhash Khot A Strong Inapproximability Gap for a Generalization of Minimum Bisection. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:371-378 [Conf]

Subhash Khot, Oded Regev Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:379-0 [Conf]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP