Conferences in DBLP
Russell Impagliazzo , Valentine Kabanets , Avi Wigderson In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:2-12 [Conf ] Manindra Agrawal Towards Uniform AC^{0} - Isomorphisms. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:13-20 [Conf ] Michal Koucký Universal Traversal Sequences with Backtracking. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:21-27 [Conf ] Lance Fortnow Comparing Notions of Full Derandomization. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:28-34 [Conf ] Albert Atserias , Nicola Galesi , Pavel Pudlák Monotone Simulations of Nonmonotone Proofs. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:36-41 [Conf ] Eli Ben-Sasson , Nicola Galesi Space Complexity of Random Formulae in Resolution. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:42-51 [Conf ] Paul Beame , Russell Impagliazzo , Ashish Sabharwal Resolution Complexity of Independent Sets in Random Graphs. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:52-68 [Conf ] Stefan S. Dantchev , Søren Riis Tree Resolution Proofs of the Weak Pigeon-Hole Principle. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:69-75 [Conf ] Aduri Pavan , Alan L. Selman Separation of NP-Completeness Notions. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:78-89 [Conf ] Richard Chang , Jon S. Squire Bounded Query Functions with Limited Output Bits. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:90-98 [Conf ] Jürgen Forster A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:100-106 [Conf ] Ronen Shaltiel Towards Proving Strong Direct Product Theorems. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:107-117 [Conf ] Harry Buhrman , Ronald de Wolf Communication Complexity Lower Bounds by Polynomials. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:120-130 [Conf ] Harry Buhrman , Christoph Dürr , Mark Heiligman , Peter Høyer , Frédéric Magniez , Miklos Santha , Ronald de Wolf Quantum Algorithms for Element Distinctness. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:131-137 [Conf ] Rocco A. Servedio , Steven J. Gortler Quantum versus Classical Learnability. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:138-148 [Conf ] Eric Allender , David A. Mix Barrington , William Hesse Uniform Circuits for Division: Consequences and Problems. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:150-159 [Conf ] Amir Shpilka Affine Projections of Symmetric Polynomials. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:160-171 [Conf ] Beate Bollig , Martin Sauerhoff , Ingo Wegener On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:172-183 [Conf ] Noga Alon , Richard Beigel Lower Bounds for Approximations by Low Degree Polynomials Over Z_{m} . [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:184-187 [Conf ] Amos Beimel , Yuval Ishai On the Power of Nonlinear Secrect-Sharing. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:188-202 [Conf ] Jack Jie Dai A Stronger Kolmogorov Zero-One Law for Resource-Bounded Measure. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:204-209 [Conf ] Klaus Ambos-Spies , Wolfgang Merkle , Jan Reimann , Frank Stephan Hausdorff Dimension in Exponential Time. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:210-217 [Conf ] Elchanan Mossel , Christopher Umans On the Complexity of Approximating the VC Dimension. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:220-225 [Conf ] Larry J. Stockmeyer , Dharmendra S. Modha Links Between Complexity Theory and Constrained Block Coding. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:226-243 [Conf ] Johan Håstad , Avi Wigderson Simple Analysis of Graph Tests for Linearity and PCP. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:244-254 [Conf ] Andrei A. Muchnik , Nikolai K. Vereshchagin Logical Operations and Kolmogorov Complexity II. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:256-265 [Conf ] Luis Antunes , Lance Fortnow , Dieter van Melkebeek Computational Depth. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:266-273 [Conf ] Péter Gács Quantum Algorithmic Entropy. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:274-283 [Conf ] Rahul Santhanam On Separators, Segregators and Time versus Space. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:286-294 [Conf ] Eric Allender , Michal Koucký , Detlef Ronneburger , Sambuddha Roy , V. Vinay Time-Space Tradeoffs in the Counting Hierarchy. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:295-302 [Conf ]