The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
Doherty, A.C., Yeong-Cherng Liang, Toner, B., Wehner, S.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
A Direct Product Theorem for Discrepancy
Lee, Troy, Shraibman, Adi, Spalek, Robert
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Constraint Logic: A Uniform Framework for Modeling Computation as Games
Demaine, E.D., Hearn, R.A.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In
Karnin, Z.S., Shpilka, A.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
Ito, T., Kobayashi, H., Preda, D., Xiaoming Sun, Yao, A.C.-C.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
The Power of Unentanglement
Aaronson, S., Beigi, S., Drucker, A., Fefferman, B., Shor, P.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
Lee, T., Shraibman, A.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
The Multiplicative Quantum Adversary
Spalek, Robert
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
2-Transitivity Is Insufficient for Local Testability
Grigorescu, E., Kaufman, T., Sudan, M.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Amplifying ZPP^SAT[1] and the Two Queries Problem
Chang, R., Purini, S.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly
Buhrman, H., Hitchcock, J.M.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes
Guruswami, V., Rudra, A.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Approximation Resistant Predicates from Pairwise Independence
Austrin, P., Mossel, E.
Published in 23rd Annual IEEE Conference on Computational Complexity, proceedings (01.06.2008)
Published in 23rd Annual IEEE Conference on Computational Complexity, proceedings (01.06.2008)
Get full text
Conference Proceeding
The Sum of d Small-Bias Generators Fools Polynomials of Degree d
Get full text
Conference Proceeding
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
Eickmeyer, K., Grohe, M., Gruber, M.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Quantum Expanders: Motivation and Constructions
Ben-Aroya, A., Schwartz, O., Ta-Shma, A.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Randomised Individual Communication Complexity
Buhrman, H., Koucky, M., Vereshchagin, N.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
New Results on Noncommutative and Commutative Polynomial Identity Testing
Arvind, V., Mukhopadhyay, P., Srinivasan, S.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding
Learning Complexity vs. Communication Complexity
Linial, N., Shraibman, A.
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Published in 2008 23rd Annual IEEE Conference on Computational Complexity (01.06.2008)
Get full text
Conference Proceeding