Default Cover Image

Proceedings 16th Annual IEEE Conference on Computational Complexity

June 18 2001 to June 21 2001

Chicago, IL, USA

Table of Contents

DedicationFull-text access may be available. Sign in or learn about subscription options.pp. viii
PrefaceFreely available from IEEE.pp. x
Conference OrganizationFreely available from IEEE.pp. xi
Best Paper AwardFreely available from IEEE.pp. xii
Ron Book Prize for Best Student PaperFull-text access may be available. Sign in or learn about subscription options.pp. xiii
Session 1- Chair: Peter Bro Miltersen, University of Aarhus
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial TimeFull-text access may be available. Sign in or learn about subscription options.pp. 0002
Session 1- Chair: Peter Bro Miltersen, University of Aarhus
Towards Uniform AC0 -IsomorphismsFull-text access may be available. Sign in or learn about subscription options.pp. 0013
Session 1- Chair: Peter Bro Miltersen, University of Aarhus
Universal Traversal Sequences with BacktrackingFull-text access may be available. Sign in or learn about subscription options.pp. 0021
Session 1- Chair: Peter Bro Miltersen, University of Aarhus
Comparing Notions of Full DerandomizationFull-text access may be available. Sign in or learn about subscription options.pp. 0028
Session 2 - Chair: Toniann Pitassi
Monotone Simulations of Nonmonotone ProofsFull-text access may be available. Sign in or learn about subscription options.pp. 0036
Session 2 - Chair: Toniann Pitassi
Space Complexity of Random Formulae in ResolutionFull-text access may be available. Sign in or learn about subscription options.pp. 0042
Session 2 - Chair: Toniann Pitassi
Resolution Complexity of Independent Sets in Random GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 0052
Session 2 - Chair: Toniann Pitassi
Tree Resolution Proofs of the Weak Pigeon-Hole PrincipleFull-text access may be available. Sign in or learn about subscription options.pp. 0069
Session 3 - Chair: D. Sivakumar, IBM Almaden
Separation of NP-Completeness NotionsFull-text access may be available. Sign in or learn about subscription options.pp. 0078
Session 3 - Chair: D. Sivakumar, IBM Almaden
Bounded Query Functions with Limited Output BitsFull-text access may be available. Sign in or learn about subscription options.pp. 0090
Session 4 - Chair: Rainer Schuler, University Ulm
A Linear Lower Bound on the Unbounded Error Probabilistic Communication ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 0100
Session 4 - Chair: Rainer Schuler, University Ulm
Towards Proving Strong Direct Product TheoremsFull-text access may be available. Sign in or learn about subscription options.pp. 0107
Session 5 - Chair: Richard Cleve, University Calgary
Communication Complexity Lower Bounds by PolynomialsFull-text access may be available. Sign in or learn about subscription options.pp. 0120
Session 5 - Chair: Richard Cleve, University Calgary
Quantum Algorithms for Element DistinctnessFull-text access may be available. Sign in or learn about subscription options.pp. 0131
Session 5 - Chair: Richard Cleve, University Calgary
Quantum versus Classical LearnabilityFull-text access may be available. Sign in or learn about subscription options.pp. 0138
Session 6 - Chair: Anna Gal, University Texas, Austin
Uniform Circuits for Division: Consequences and ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 0150
Session 6 - Chair: Anna Gal, University Texas, Austin
Affine Projections of Symmetric PolynomialsFull-text access may be available. Sign in or learn about subscription options.pp. 0160
Session 6 - Chair: Anna Gal, University Texas, Austin
On the Non-Approximability of Boolean Functions by OBDDs and Read-k-Times Branching ProgramsFull-text access may be available. Sign in or learn about subscription options.pp. 0172
Session 6 - Chair: Anna Gal, University Texas, Austin
Lower Bounds for Approximations by Low Degree Polynomials Over Z_mFull-text access may be available. Sign in or learn about subscription options.pp. 0184
Session 6 - Chair: Anna Gal, University Texas, Austin
On the Power of Nonlinear Secret-SharingFull-text access may be available. Sign in or learn about subscription options.pp. 0188
Session 7 - Chair: D. Sivakumar, IBM Almaden
A Stronger Kolmogorov Zero-One Law for Resource-Bounded MeasureFull-text access may be available. Sign in or learn about subscription options.pp. 0204
Session 7 - Chair: D. Sivakumar, IBM Almaden
Hausdorff Dimension in Exponential TimeFull-text access may be available. Sign in or learn about subscription options.pp. 0210
Session 8 - Chair: Salil Vadhan, IAS & Harvard University
On the Complexity of Approximating the VC DimensionFull-text access may be available. Sign in or learn about subscription options.pp. 0220
Session 8 - Chair: Salil Vadhan, IAS & Harvard University
Links Between Complexity Theory and Constrained Block CodingFull-text access may be available. Sign in or learn about subscription options.pp. 0226
Session 8 - Chair: Salil Vadhan, IAS & Harvard University
Simple Analysis of Graph Tests for Linearity and PCPFull-text access may be available. Sign in or learn about subscription options.pp. 0244
Session 9 - Chair: Madhu Sudan, MIT
Logical Operations and Kolmogorov Complexity IIFull-text access may be available. Sign in or learn about subscription options.pp. 0256
Session 9 - Chair: Madhu Sudan, MIT
Computational DepthFull-text access may be available. Sign in or learn about subscription options.pp. 0266
Session 9 - Chair: Madhu Sudan, MIT
Quantum Algorithmic EntropyFull-text access may be available. Sign in or learn about subscription options.pp. 0274
Session 10 - Chair: Uriel Feige, Weizmann Institute
On Separators, Segregators and Time versus SpaceFull-text access may be available. Sign in or learn about subscription options.pp. 0286
Session 10 - Chair: Uriel Feige, Weizmann Institute
Time-Space Tradeoffs in the Counting HierarchyFull-text access may be available. Sign in or learn about subscription options.pp. 0295
Session 10 - Chair: Uriel Feige, Weizmann Institute
Author IndexFreely available from IEEE.pp. 0303
Showing 37 out of 37