Vyzkoušejte nový nástroj s podporou AI
Summon Research Assistant
BETA
Loading…
Loading…
Loading…
Loading…
Loading…
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions
Jain, Rahul, Pereszlenyi, Attila, Penghui Yao
Published in 2014 IEEE 29th Conference on Computational Complexity (CCC) (01.06.2014)
Published in 2014 IEEE 29th Conference on Computational Complexity (CCC) (01.06.2014)
Get full text
Conference Proceeding
Loading…
Property Testing Lower Bounds via Communication Complexity
Blais, E., Brody, J., Matulef, K.
Published in 2011 IEEE 26th Annual Conference on Computational Complexity (01.06.2011)
Published in 2011 IEEE 26th Annual Conference on Computational Complexity (01.06.2011)
Get full text
Conference Proceeding
Loading…
Loading…
On the Parameterized and Approximation Hardness of Metric Dimension
Hartung, Sepp, Nichterlein, Andre
Published in Proceedings / IEEE Conference on Computational Complexity (01.06.2013)
Published in Proceedings / IEEE Conference on Computational Complexity (01.06.2013)
Get full text
Conference Proceeding
Loading…
Fooling Functions of Halfspaces under Product Distributions
Gopalan, Parikshit, O'Donnell, Ryan, Yi Wu, Zuckerman, David
Published in 2010 IEEE 25th Annual Conference on Computational Complexity (01.06.2010)
Published in 2010 IEEE 25th Annual Conference on Computational Complexity (01.06.2010)
Get full text
Conference Proceeding
Loading…
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
Ito, T., Kobayashi, H., Matsumoto, K.
Published in 2009 24th Annual IEEE Conference on Computational Complexity (01.07.2009)
Published in 2009 24th Annual IEEE Conference on Computational Complexity (01.07.2009)
Get full text
Conference Proceeding
Loading…
The Communication Complexity of Correlation
Harsha, Prahladh, Jain, Rahul, McAllester, David, Radhakrishnan, Jaikumar
Published in Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) (01.06.2007)
Published in Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) (01.06.2007)
Get full text
Conference Proceeding
Loading…
Loading…
Lower Bounds for Testing Properties of Functions over Hypergrid Domains
Blais, Eric, Raskhodnikova, Sofya, Yaroslavtsev, Grigory
Published in 2014 IEEE 29th Conference on Computational Complexity (CCC) (01.06.2014)
Published in 2014 IEEE 29th Conference on Computational Complexity (CCC) (01.06.2014)
Get full text
Conference Proceeding
Loading…
A tight lower bound for restricted pir protocols
Beigel, Richard, Fortnow, Lance, Gasarch, William
Published in Computational complexity (01.05.2006)
Published in Computational complexity (01.05.2006)
Get full text
Journal Article
Loading…
Near-Optimal and Explicit Bell Inequality Violations
Buhrman, H., Regev, O., Scarpa, G., de Wolf, R.
Published in 2011 IEEE 26th Annual Conference on Computational Complexity (01.06.2011)
Published in 2011 IEEE 26th Annual Conference on Computational Complexity (01.06.2011)
Get full text
Conference Proceeding
Loading…
Loading…
Loading…
A Composition Theorem for Parity Kill Number
O'Donnell, Ryan, Wright, John, Yu Zhao, Xiaorui Sun, Li-Yang Tan
Published in 2014 IEEE 29th Conference on Computational Complexity (CCC) (01.06.2014)
Published in 2014 IEEE 29th Conference on Computational Complexity (CCC) (01.06.2014)
Get full text
Conference Proceeding
Loading…
Planar Graph Isomorphism is in Log-Space
Datta, S., Limaye, N., Nimbhorkar, P., Thierauf, T., Wagner, F.
Published in 2009 24th Annual IEEE Conference on Computational Complexity (01.07.2009)
Published in 2009 24th Annual IEEE Conference on Computational Complexity (01.07.2009)
Get full text
Conference Proceeding
Loading…
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
Austrin, P., Khot, S., Safra, M.
Published in 2009 24th Annual IEEE Conference on Computational Complexity (01.07.2009)
Published in 2009 24th Annual IEEE Conference on Computational Complexity (01.07.2009)
Get full text
Conference Proceeding