NDLI: Cover Art

Please wait, while we are loading the content...

2014 IEEE 29th Conference on Computational Complexity (CCC)

2013 IEEE Conference on Computational Complexity

2012 IEEE 27th Conference on Computational Complexity

2011 IEEE 26th Annual Conference on Computational Complexity

2010 IEEE 25th Annual Conference on Computational Complexity

2009 24th Annual IEEE Conference on Computational Complexity

Table of Contents

Conference Information

Poly-logarithmic Independence Fools AC^0 Circuits

k-Subgraph Isomorphism on AC_0 Circuits

Fixed-Polynomial Size Circuit Bounds

A New Characterization of ACC^0 and Probabilistic CC^0

A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent

The Proof Complexity of Polynomial Identities

Locally Testable Codes Require Redundant Testers

Every Permutation CSP of arity 3 is Approximation Resistant

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Are PCPs Inherent in Efficient Arguments?

Extractors for Low-Weight Affine Sources

Extractors for Varieties

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma

Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution

An Almost Optimal Rank Bound for Depth-3 Identities

Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete

Improved Approximation of Linear Threshold Functions

On the Complexity of Boolean Functions in Different Characteristics

The Complexity of the Annihilating Polynomial

One-Way Functions and the Berman-Hartmanis Conjecture

Planar Graph Isomorphism is in Log-Space

Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies

Quantum Copy-Protection and Quantum Money

Parallel Approximation of Non-interactive Zero-sum Quantum Games

Lower Bounds on Quantum Multiparty Communication Complexity

Increasing the Gap between Descriptional Complexity and Algorithmic Probability

Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in

Multitask Efficiencies in the Decision Tree Model

Worst-Case Running Times for Average-Case Algorithms

On Basing ZK ≠ BPP on the Hardness of PAC Learning

Infinite vs. Finite Space-Bounded Randomized Computations

On the Communication Complexity of Read-Once AC^0 Formulae

Lower Bounds on the Randomized Communication Complexity of Read-Once Functions

An Approximation Algorithm for Approximation Rank

A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences

New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques

The Maximum Communication Complexity of Multi-Party Pointer Jumping

2008 23rd Annual IEEE Conference on Computational Complexity

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)

21st Annual IEEE Conference on Computational Complexity (CCC'06)

20th Annual IEEE Conference on Computational Complexity (CCC'05)

Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.

Proceedings 17th IEEE Annual Conference on Computational Complexity

Proceedings 16th Annual IEEE Conference on Computational Complexity

Proceedings 15th Annual IEEE Conference on Computational Complexity

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)

Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)

Proceedings of Computational Complexity. Twelfth Annual IEEE Conference

Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in