A Composition Theorem for Conical Juntas

Size: px
Start display at page:

Download "A Composition Theorem for Conical Juntas"

Transcription

1 A Composition Theorem for Conical Juntas Mika Göös T.S. Jayram University of Toronto IBM Almaden Göös and Jayram A composition theorem for conical juntas 29th May / 12

2 Motivation Randomised communication AND-OR trees 1 Set-disjointness ORn AND 2 2 Tribes AND n OR n AND 2 Ω(n) Ω(n) [KS 87] [Raz 91] [BJKS 04] (info) [JKS 03] (info) [HJ 13] k AND n 1/k OR n 1/k AND 2 n/2 O(k) [JKR 09] (info) [LS 10] (info) Göös and Jayram A composition theorem for conical juntas 29th May / 12

3 Motivation Randomised communication AND-OR trees 1 Set-disjointness ORn AND 2 2 Tribes AND n OR n AND 2 Ω(n) Ω(n) [KS 87] [Raz 91] [BJKS 04] (info) [JKS 03] (info) [HJ 13] k AND n 1/k OR n 1/k AND 2 n/2 O(k) [JKR 09] (info) [LS 10] (info) log n AND 2 OR 2 AND 2 O(n ) Ω( n) Gap! [Snir 85] [JKZ 10] Göös and Jayram A composition theorem for conical juntas 29th May / 12

4 New tool Conical juntas Communication-to-query theorem [GLMWZ 15]: For every boolean function f : {0, 1} n {0, 1}, BPP cc ɛ ( f IP log n ) Ω(deg + ɛ ( f )) f Compose with IP f z 1 z 2 z 3 z 4 z 5 IP IP IP IP IP x 1 y 1 x 2 y 2 x 3 y 3 x 4 y 4 x 5 y 5 Göös and Jayram A composition theorem for conical juntas 29th May / 12

5 New tool Conical juntas Communication-to-query theorem [GLMWZ 15]: For every boolean function f : {0, 1} n {0, 1}, BPP cc ɛ ( f IP log n ) Ω(deg + ɛ ( f )) Conical juntas: Nonnegative combination of conjunctions OR 2 : 1 2 x x x 1x x 1 x 2 Approximate conical junta degree deg + ɛ ( f ) is the least degree of a conical junta h such that x {0, 1} n : f (x) h(x) ɛ. Göös and Jayram A composition theorem for conical juntas 29th May / 12

6 New tool Conical juntas Communication-to-query theorem [GLMWZ 15]: For every boolean function f : {0, 1} n {0, 1}, BPP cc ɛ ( f IP log n ) Ω(deg + ɛ ( f )) Conical juntas: Nonnegative combination of conjunctions OR 2 : 1 2 x x x 1x x 1 x 2 Approximate conical junta degree deg + ɛ ( f ) is the least degree of a conical junta h such that x {0, 1} n : f (x) h(x) ɛ. Previous talk: 0-1 coefficients = Unambiguous DNFs Göös and Jayram A composition theorem for conical juntas 29th May / 12

7 New tool Big picture BPP dt WAPP dt approx. junta deg Open problem Classical world [GLMWZ 15] BPP cc WAPP cc approx. rank + BQP dt AWPP dt approx. poly deg Open problem Quantum world [She 09, SZ 09] BQP cc AWPP cc approx. rank Göös and Jayram A composition theorem for conical juntas 29th May / 12

8 This work: A Composition Theorem for Conical Juntas That is: Want to understand approximate conical junta degree of f g in terms of f and g Göös and Jayram A composition theorem for conical juntas 29th May / 12

9 Our results Applications = M M M M M M M M M M M M M NAND 4 (OR AND) 2 MAJ 3 3 Query: deg + 1/n (NAND k ) Ω(n ) deg + 1/n (MAJ k 3 ) Ω( k ) Göös and Jayram A composition theorem for conical juntas 29th May / 12

10 Our results Applications = M M M M M M M M M M M M M NAND 4 (OR AND) 2 MAJ 3 3 Query: deg + 1/n (NAND k ) Ω(n ) deg + 1/n (MAJ k 3 ) Ω( k ) Previously: Note: O(2.65 k ) BPP dt (MAJ k 3 ) Ω(2.57 k ) [JKS 03, LNPV 06, Leo 13, MNSSTX 15] Unamplifiability of error Göös and Jayram A composition theorem for conical juntas 29th May / 12

11 Our results Applications = M M M M M M M M M M M M M NAND 4 (OR AND) 2 MAJ 3 3 Query: deg + 1/n (NAND k ) Ω(n ) deg + 1/n (MAJ k 3 ) Ω( k ) Communication: BPP cc (NAND k ) Ω(n ) BPP cc (MAJ k 3 ) Ω(2.59 k ) Note: Log-factor loss Göös and Jayram A composition theorem for conical juntas 29th May / 12

12 Formalising the composition theorem Average degree For h = w C C, adeg x (h) := w C C C(x) adeg(h) := max x adeg x (h) Göös and Jayram A composition theorem for conical juntas 29th May / 12

13 Formalising the composition theorem Average degree For h = w C C, adeg x (h) := w C C C(x) adeg(h) := max x adeg x (h) Simplification: Consider zero-error conical juntas Example: adeg(or 2 ) = 3/2, adeg(maj 3 ) = 8/3 Göös and Jayram A composition theorem for conical juntas 29th May / 12

14 Formalising the composition theorem Average degree For h = w C C, adeg x (h) := w C C C(x) adeg(h) := max x adeg x (h) Simplification: Consider zero-error conical juntas Example: adeg(or 2 ) = 3/2, adeg(maj 3 ) = 8/3 First formalisation attempt adeg( f g) adeg( f ) min { adeg(g), adeg( g) }? Göös and Jayram A composition theorem for conical juntas 29th May / 12

15 Formalising the composition theorem Average degree For h = w C C, adeg x (h) := w C C C(x) adeg(h) := max x adeg x (h) Simplification: Consider zero-error conical juntas Example: adeg(or 2 ) = 3/2, adeg(maj 3 ) = 8/3 First formalisation attempt adeg( f g) adeg( f ) min { adeg(g), adeg( g) }? Counter-example! adeg(or 2 MAJ 3 ) = < 4 Göös and Jayram A composition theorem for conical juntas 29th May / 12

16 Formalisation LP duality cf. [She 13, BT 15] adeg(h; b 0, b 1 ) charge bi for reading an input bit that is i Primal / Dual for average degree of f min adeg ( ) w C C; b 0, b 1 subject to w C C(x) = f (x), x w C 0, C max Ψ, f subject to Ψ, C adeg(c; b 0, b 1 ), C Ψ(x) R, x Göös and Jayram A composition theorem for conical juntas 29th May / 12

17 Formalisation Statement of theorem Regular certificates: Circumventing the counter-example Require that Ψ is balanced (has a primal meaning!) Göös and Jayram A composition theorem for conical juntas 29th May / 12

18 Formalisation Statement of theorem Regular certificates: Circumventing the counter-example Require that Ψ is balanced (has a primal meaning!) Require that Ψ 1 and Ψ 0 for f and f share structure Göös and Jayram A composition theorem for conical juntas 29th May / 12

19 Formalisation Statement of theorem Regular certificates: Circumventing the counter-example Require that Ψ is balanced (has a primal meaning!) Require that Ψ 1 and Ψ 0 for f and f share structure Composition Theorem Suppose we have regular LP certificates witnessing adeg(g) b 1 adeg( f ; b 0, b 1 ) a 1 adeg( g) b 0 adeg( f ; b 0, b 1 ) a 0 then f g admits a regular LP certificate witnessing adeg( f g) a 1 adeg( f g) a 0 Göös and Jayram A composition theorem for conical juntas 29th May / 12

20 Regular certificates for MAJ 3 0 1/2 1/2 5/6 5/6 5/6 5/6 5/6 5/6 1/6 1/6 1/6 + = /6 5/6 5/6 0 Ψ 1 0 ˆΨ 1 0 Ψ 1 + ˆΨ 1 MAJ 3 MAJ3 2 MAJ3 3 MAJ3 4 # dual variables: lower bound: Open! Göös and Jayram A composition theorem for conical juntas 29th May / 12

21 Subsequent application Eight-author paper: Anshu, Belovs, Ben-David, Göös, Jain, Kothari, Lee, and Santha [ECCC 16] 1 total F : BPP cc (F) Ω(BQP cc (F) 2.5 ) 2 total F : BPP cc (F) log 2 o(1) χ(f) Göös and Jayram A composition theorem for conical juntas 29th May / 12

22 Subsequent application Eight-author paper: Anshu, Belovs, Ben-David, Göös, Jain, Kothari, Lee, and Santha [ECCC 16] 1 total F : BPP cc (F) Ω(BQP cc (F) 2.5 ) 2 total F : BPP cc (F) log 2 o(1) χ(f) Proof idea for 1 deg + ɛ (SIMON n AND n OR n ) Ω(n 2.5 ) Communication-to-query BPP cc (SIMON n AND n OR n IP log n ) Ω(n 2.5 ) Cheat sheet technique BPP cc( (SIMON n AND n OR n IP log n ) CS ) Ω(n 2.5 ) Göös and Jayram A composition theorem for conical juntas 29th May / 12

23 Open problems Composition theorems: Explain why our composition theorem works!-) Better certificates for MAJ3 k? Does a composition theorem hold for BPP dt? Simulation theorems: Communication-to-query simulation for BPP? Constant-size gadgets for junta-based simulation? More things to do with conical juntas? Göös and Jayram A composition theorem for conical juntas 29th May / 12

24 Open problems Composition theorems: Explain why our composition theorem works!-) Better certificates for MAJ3 k? Does a composition theorem hold for BPP dt? Simulation theorems: Communication-to-query simulation for BPP? Constant-size gadgets for junta-based simulation? More things to do with conical juntas? Cheers! Göös and Jayram A composition theorem for conical juntas 29th May / 12

Clique vs. Independent Set

Clique vs. Independent Set Lower Bounds for Clique vs. Independent Set Mika Göös University of Toronto Mika Göös (Univ. of Toronto) Clique vs. Independent Set rd February 5 / 4 On page 6... Mika Göös (Univ. of Toronto) Clique vs.

More information

Monotone Circuit Lower Bounds from Resolution

Monotone Circuit Lower Bounds from Resolution Monotone Circuit Lower Bounds from Resolution Ankit Garg Mika Göös Pritish Kamath Dmitry Sokolov MSR Harvard MIT KTH Mika Göös Monotone Circuits & Resolution 25th October 2017 1 / 22 Background: Query-to-communication

More information

Chebyshev Polynomials, Approximate Degree, and Their Applications

Chebyshev Polynomials, Approximate Degree, and Their Applications Chebyshev Polynomials, Approximate Degree, and Their Applications Justin Thaler 1 Georgetown University Boolean Functions Boolean function f : { 1, 1} n { 1, 1} AND n (x) = { 1 (TRUE) if x = ( 1) n 1 (FALSE)

More information

Communication Lower Bounds via Query Complexity

Communication Lower Bounds via Query Complexity Communication Lower Bounds via Query Complexity by Mika Göös A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy, Graduate Department of Computer Science, University

More information

The Polynomial Method Strikes Back: Tight Quantum Query Bounds Via Dual Polynomials

The Polynomial Method Strikes Back: Tight Quantum Query Bounds Via Dual Polynomials The Polynomial Method Strikes Back: Tight Quantum Query Bounds Via Dual Polynomials Justin Thaler (Georgetown) Joint work with: Mark Bun (Princeton) Robin Kothari (MSR Redmond) Boolean Functions Boolean

More information

Quantum algorithms based on span programs

Quantum algorithms based on span programs Quantum algorithms based on span programs Ben Reichardt IQC, U Waterloo [arxiv:0904.2759] Model: Complexity measure: Quantum algorithms Black-box query complexity Span programs Witness size [KW 93] [RŠ

More information

Tight Bounds for Distributed Streaming

Tight Bounds for Distributed Streaming Tight Bounds for Distributed Streaming (a.k.a., Distributed Functional Monitoring) David Woodruff IBM Research Almaden Qin Zhang MADALGO, Aarhus Univ. STOC 12 May 22, 2012 1-1 The distributed streaming

More information

Query-to-Communication Lifting for BPP

Query-to-Communication Lifting for BPP 58th Annual IEEE Symposium on Foundations of Computer Science Query-to-Communication Lifting for BPP Mika Göös Computer Science Department Harvard University Cambridge, MA, USA Email: mika@seas.harvard.edu

More information

Communication Lower Bounds via Critical Block Sensitivity

Communication Lower Bounds via Critical Block Sensitivity Communication Lower Bounds via Critical Block Sensitivity Mika Göös & Toniann Pitassi University of Toronto Göös & Pitassi (Univ. of Toronto) Communication Lower Bounds 13th January 2014 1 / 18 Communication

More information

THE CIS PROBLEM AND RELATED RESULTS IN GRAPH THEORY

THE CIS PROBLEM AND RELATED RESULTS IN GRAPH THEORY THE CIS PROBLEM AND RELATED RESULTS IN GRAPH THEORY RYAN ALWEISS, YANG LIU Abstract. In this survey, we will show that there are instances of the CIS problem on n vertices which cannot be solved deterministically

More information

Faster quantum algorithm for evaluating game trees

Faster quantum algorithm for evaluating game trees Faster quantum algorithm for evaluating game trees x 7 x 8 Ben Reichardt xx1 1 x 2 x 3 x 4 x 6 OR x 9 x1 1 x 5 x 9 University of Waterloo x 5 AND OR AND AND OR AND ϕ(x) x 7 x 8 x 1 x 2 x 3 x 4 x 6 OR x

More information

A Nearly Optimal Lower Bound on the Approximate Degree of AC 0

A Nearly Optimal Lower Bound on the Approximate Degree of AC 0 58th Annual IEEE Symposium on Foundations of Computer Science A Nearly Optimal Lower Bound on the Approximate Degree of AC 0 Mark Bun Department of Computer Science Princeton University Princeton, NJ,

More information

Junta Approximations for Submodular, XOS and Self-Bounding Functions

Junta Approximations for Submodular, XOS and Self-Bounding Functions Junta Approximations for Submodular, XOS and Self-Bounding Functions Vitaly Feldman Jan Vondrák IBM Almaden Research Center Simons Institute, Berkeley, October 2013 Feldman-Vondrák Approximations by Juntas

More information

Enumeration of Boolean Functions of Sensitivity Three and Inheritance of Nondegeneracy

Enumeration of Boolean Functions of Sensitivity Three and Inheritance of Nondegeneracy Enumeration of Boolean Functions of Sensitivity Three and Inheritance of Nondegeneracy Kazuyuki Amano Department of Computer Science, Gunma University 1-5-1 Tenjin, Kiryu, Gunma 376-8515, Japan October

More information

From query complexity to computational complexity (for optimization of submodular functions)

From query complexity to computational complexity (for optimization of submodular functions) From query complexity to computational complexity (for optimization of submodular functions) Shahar Dobzinski 1 Jan Vondrák 2 1 Cornell University Ithaca, NY 2 IBM Almaden Research Center San Jose, CA

More information

A semi-definite program for quantum query complexity

A semi-definite program for quantum query complexity A semi-definite program for quantum query complexity Ben Reichardt University of Waterloo [These slides and notes are for a 30-minute talk given at the second Barriers in Computational Complexity Workshop,

More information

arxiv: v2 [quant-ph] 25 May 2018

arxiv: v2 [quant-ph] 25 May 2018 The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials arxiv:1710.09079v2 [quant-ph] 25 May 2018 Mark Bun Princeton University mbun@cs.princeton.edu Robin Kothari Microsoft

More information

Direct product theorem for discrepancy

Direct product theorem for discrepancy Direct product theorem for discrepancy Troy Lee Rutgers University Adi Shraibman Weizmann Institute of Science Robert Špalek Google Direct product theorems: Why is Google interested? Direct product theorems:

More information

Separating Decision Tree Complexity from Subcube Partition Complexity

Separating Decision Tree Complexity from Subcube Partition Complexity Separating Decision Tree Complexity from Subcube Partition Complexity Robin Kothari 1,2, David Racicot-Desloges 3,4, and Miklos Santha 4,5 1 Center for Theoretical Physics, Massachusetts Institute of Technology,

More information

arxiv: v1 [cs.cc] 16 Mar 2017

arxiv: v1 [cs.cc] 16 Mar 2017 A Nearly Optimal Lower Bound on the Approximate Degree of AC 0 Mark Bun mbun@cs.princeton.edu Justin Thaler justin.thaler@georgetown.edu arxiv:1703.05784v1 [cs.cc] 16 Mar 2017 Abstract The approximate

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i

More information

arxiv: v1 [cs.cc] 12 Feb 2009

arxiv: v1 [cs.cc] 12 Feb 2009 Symposium on Theoretical Aspects of Computer Science 2009 (Freiburg), pp. 685 696 www.stacs-conf.org arxiv:0902.2146v1 [cs.cc] 12 Feb 2009 A STRONGER LP BOUND FOR FORMULA SIZE LOWER BOUNDS VIA CLIQUE CONSTRAINTS

More information

Direct product theorem for discrepancy

Direct product theorem for discrepancy Direct product theorem for discrepancy Troy Lee Rutgers University Joint work with: Robert Špalek Direct product theorems Knowing how to compute f, how can you compute f f f? Obvious upper bounds: If can

More information

Lower Bound Techniques for Multiparty Communication Complexity

Lower Bound Techniques for Multiparty Communication Complexity Lower Bound Techniques for Multiparty Communication Complexity Qin Zhang Indiana University Bloomington Based on works with Jeff Phillips, Elad Verbin and David Woodruff 1-1 The multiparty number-in-hand

More information

Agnostic Learning of Disjunctions on Symmetric Distributions

Agnostic Learning of Disjunctions on Symmetric Distributions Agnostic Learning of Disjunctions on Symmetric Distributions Vitaly Feldman vitaly@post.harvard.edu Pravesh Kothari kothari@cs.utexas.edu May 26, 2014 Abstract We consider the problem of approximating

More information

Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds

Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds Kenya Ueno The Young Researcher Development Center and Graduate School of Informatics, Kyoto University kenya@kuis.kyoto-u.ac.jp Abstract.

More information

Properties and Applications of Boolean Function Composition

Properties and Applications of Boolean Function Composition Electronic Colloquium on Computational Complexity, Report No. 163 (2012) Properties and Applications of Boolean Function Composition Avishay Tal Abstract For Boolean functions f : {0, 1} n {0, 1} and g

More information

Direct product theorem for discrepancy

Direct product theorem for discrepancy Direct product theorem for discrepancy Troy Lee Rutgers University Robert Špalek Google Direct product theorems: Why is Google interested? Direct product theorems: Why should Google be interested? Direct

More information

Post-selected classical query complexity

Post-selected classical query complexity Post-selected classical query complexity Chris Cade School of Mathematics, University of Bristol, UK May 5, 08 arxiv:804.000v [cs.cc] 4 May 08 Abstract We study classical query algorithms with post-selection,

More information

arxiv: v2 [cs.cc] 5 Dec 2016

arxiv: v2 [cs.cc] 5 Dec 2016 Randomized query complexity of sabotaged and composed functions Shalev Ben-David Massachusetts Institute of Technology shalev@mit.edu Robin Kothari Massachusetts Institute of Technology rkothari@mit.edu

More information

Lower bounds on the size of semidefinite relaxations. David Steurer Cornell

Lower bounds on the size of semidefinite relaxations. David Steurer Cornell Lower bounds on the size of semidefinite relaxations David Steurer Cornell James R. Lee Washington Prasad Raghavendra Berkeley Institute for Advanced Study, November 2015 overview of results unconditional

More information

Communication Lower Bounds Using Dual Polynomials

Communication Lower Bounds Using Dual Polynomials Communication Lower Bounds Using Dual Polynomials ALEXANDER A. SHERSTOV Univ. of Texas at Austin, Dept. of Comp. Sciences, sherstov@cs.utexas.edu May 14, 2008 Abstract Representations of Boolean functions

More information

Nondeterminism LECTURE Nondeterminism as a proof system. University of California, Los Angeles CS 289A Communication Complexity

Nondeterminism LECTURE Nondeterminism as a proof system. University of California, Los Angeles CS 289A Communication Complexity University of California, Los Angeles CS 289A Communication Complexity Instructor: Alexander Sherstov Scribe: Matt Brown Date: January 25, 2012 LECTURE 5 Nondeterminism In this lecture, we introduce nondeterministic

More information

Succinct linear programs for easy problems

Succinct linear programs for easy problems Succinct linear programs for easy problems David Bremner U. New Brunswick / visiting TU Berlin 24-11-2014 Joint Work with D. Avis, H.R. Tiwary, and O. Watanabe Outline 1 Matchings and Matching Polytopes

More information

Lecture 6: Conic Optimization September 8

Lecture 6: Conic Optimization September 8 IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions

More information

Introduction to Quantum Information Processing

Introduction to Quantum Information Processing Introduction to Quantum Information Processing Lecture 6 Richard Cleve Overview of Lecture 6 Continuation of teleportation Computation and some basic complexity classes Simple quantum algorithms in the

More information

6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC

6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 2003 2003.09.02.10 6. The Positivstellensatz Basic semialgebraic sets Semialgebraic sets Tarski-Seidenberg and quantifier elimination Feasibility

More information

How hard is it to approximate the Jones polynomial?

How hard is it to approximate the Jones polynomial? How hard is it to approximate the Jones polynomial? Greg Kuperberg UC Davis June 17, 2009 The Jones polynomial and quantum computation Recall the Jones polynomial ( = Kauffman bracket): = q 1/2 q 1/2 =

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Petros Wallden Lecture 7: Complexity & Algorithms I 13th October 016 School of Informatics, University of Edinburgh Complexity - Computational Complexity: Classification

More information

Comp487/587 - Boolean Formulas

Comp487/587 - Boolean Formulas Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested

More information

A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity

A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity Electronic Colloquium on Computational Complexity, Report No. 27 (2014) A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity Krišjānis Prūsis and Andris Ambainis

More information

Majority is incompressible by AC 0 [p] circuits

Majority is incompressible by AC 0 [p] circuits Majority is incompressible by AC 0 [p] circuits Igor Carboni Oliveira Columbia University Joint work with Rahul Santhanam (Univ. Edinburgh) 1 Part 1 Background, Examples, and Motivation 2 Basic Definitions

More information

On the Sensitivity Conjecture for Disjunctive Normal Forms. Karthik C. S. (Weizmann Institute of Science)

On the Sensitivity Conjecture for Disjunctive Normal Forms. Karthik C. S. (Weizmann Institute of Science) On the Sensitivity Conjecture for Disjunctive Normal Forms Karthik C. S. (Weizmann Institute of Science) Joint work with Sébastien Tavenas (Université de Savoie-Mont-Blanc). Boolean Function f : {0, 1}

More information

Reflections Reflections

Reflections Reflections Reflections Reflections for quantum query algorithms Ben Reichardt University of Waterloo Reflections Reflections for quantum query algorithms Ben Reichardt University of Waterloo Reflections for quantum

More information

Quantum Complexity Theory. Wim van Dam HP Labs MSRI UC Berkeley SQUINT 3 June 16, 2003

Quantum Complexity Theory. Wim van Dam HP Labs MSRI UC Berkeley SQUINT 3 June 16, 2003 Quantum Complexity Theory Wim van Dam HP Labs MSRI UC Berkeley SQUINT 3 June 16, 2003 Complexity Theory Complexity theory investigates what resources (time, space, randomness, etc.) are required to solve

More information

Math 262A Lecture Notes - Nechiporuk s Theorem

Math 262A Lecture Notes - Nechiporuk s Theorem Math 6A Lecture Notes - Nechiporuk s Theore Lecturer: Sa Buss Scribe: Stefan Schneider October, 013 Nechiporuk [1] gives a ethod to derive lower bounds on forula size over the full binary basis B The lower

More information

Approximation Algorithms and Hardness of Approximation. IPM, Jan Mohammad R. Salavatipour Department of Computing Science University of Alberta

Approximation Algorithms and Hardness of Approximation. IPM, Jan Mohammad R. Salavatipour Department of Computing Science University of Alberta Approximation Algorithms and Hardness of Approximation IPM, Jan 2006 Mohammad R. Salavatipour Department of Computing Science University of Alberta 1 Introduction For NP-hard optimization problems, we

More information

Midterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.

Midterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane

More information

Agenda. What is a complexity class? What are the important complexity classes? How do you prove an algorithm is in a certain class

Agenda. What is a complexity class? What are the important complexity classes? How do you prove an algorithm is in a certain class Complexity Agenda What is a complexity class? What are the important complexity classes? How do you prove an algorithm is in a certain class Complexity class A complexity class is a set All problems within

More information

Lecture 11 October 7, 2013

Lecture 11 October 7, 2013 CS 4: Advanced Algorithms Fall 03 Prof. Jelani Nelson Lecture October 7, 03 Scribe: David Ding Overview In the last lecture we talked about set cover: Sets S,..., S m {,..., n}. S has cost c S. Goal: Cover

More information

Evaluation of DNF Formulas

Evaluation of DNF Formulas Evaluation of DNF Formulas Sarah R. Allen Carnegie Mellon University Computer Science Department Pittsburgh, PA, USA Lisa Hellerstein and Devorah Kletenik Polytechnic Institute of NYU Dept. of Computer

More information

Today. Few Comments. PCP Theorem, Simple proof due to Irit Dinur [ECCC, TR05-046]! Based on some ideas promoted in [Dinur- Reingold 04].

Today. Few Comments. PCP Theorem, Simple proof due to Irit Dinur [ECCC, TR05-046]! Based on some ideas promoted in [Dinur- Reingold 04]. Today Few Comments PCP Theorem, Simple proof due to Irit Dinur [ECCC, TR05-046]! Based on some ideas promoted in [Dinur- Reingold 04]. Remarkably simple novel proof. Leads to new quantitative results too!

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk We now turn to a second major topic in quantum algorithms, the concept

More information

linear programming and approximate constraint satisfaction

linear programming and approximate constraint satisfaction linear programming and approximate constraint satisfaction Siu On Chan MSR New England James R. Lee University of Washington Prasad Raghavendra UC Berkeley David Steurer Cornell results MAIN THEOREM: Any

More information

CS Introduction to Complexity Theory. Lecture #11: Dec 8th, 2015

CS Introduction to Complexity Theory. Lecture #11: Dec 8th, 2015 CS 2401 - Introduction to Complexity Theory Lecture #11: Dec 8th, 2015 Lecturer: Toniann Pitassi Scribe Notes by: Xu Zhao 1 Communication Complexity Applications Communication Complexity (CC) has many

More information

There are no zero-hard problems in multiparty communication complexity

There are no zero-hard problems in multiparty communication complexity There are no zero-hard problems in multiparty communication complexity László Babai and Denis Pankratov University of Chicago DRAFT: 2015-04-29 7:00pm Abstract We study the feasibility of generalizing

More information

Introduction to Computational Learning Theory

Introduction to Computational Learning Theory Introduction to Computational Learning Theory The classification problem Consistent Hypothesis Model Probably Approximately Correct (PAC) Learning c Hung Q. Ngo (SUNY at Buffalo) CSE 694 A Fun Course 1

More information

Lecture 4: NP and computational intractability

Lecture 4: NP and computational intractability Chapter 4 Lecture 4: NP and computational intractability Listen to: Find the longest path, Daniel Barret What do we do today: polynomial time reduction NP, co-np and NP complete problems some examples

More information

Compute the Fourier transform on the first register to get x {0,1} n x 0.

Compute the Fourier transform on the first register to get x {0,1} n x 0. CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary

More information

6-1 Computational Complexity

6-1 Computational Complexity 6-1 Computational Complexity 6. Computational Complexity Computational models Turing Machines Time complexity Non-determinism, witnesses, and short proofs. Complexity classes: P, NP, conp Polynomial-time

More information

Simulating classical circuits with quantum circuits. The complexity class Reversible-P. Universal gate set for reversible circuits P = Reversible-P

Simulating classical circuits with quantum circuits. The complexity class Reversible-P. Universal gate set for reversible circuits P = Reversible-P Quantum Circuits Based on notes by John Watrous and also Sco8 Aaronson: www.sco8aaronson.com/democritus/ John Preskill: www.theory.caltech.edu/people/preskill/ph229 Outline Simulating classical circuits

More information

Quantum Algorithms for Finding Constant-sized Sub-hypergraphs

Quantum Algorithms for Finding Constant-sized Sub-hypergraphs Quantum Algorithms for Finding Constant-sized Sub-hypergraphs Seiichiro Tani (Joint work with François Le Gall and Harumichi Nishimura) NTT Communication Science Labs., NTT Corporation, Japan. The 20th

More information

Lecture Lecture 9 October 1, 2015

Lecture Lecture 9 October 1, 2015 CS 229r: Algorithms for Big Data Fall 2015 Lecture Lecture 9 October 1, 2015 Prof. Jelani Nelson Scribe: Rachit Singh 1 Overview In the last lecture we covered the distance to monotonicity (DTM) and longest

More information

Tight Bounds for Distributed Functional Monitoring

Tight Bounds for Distributed Functional Monitoring Tight Bounds for Distributed Functional Monitoring Qin Zhang MADALGO, Aarhus University Joint with David Woodruff, IBM Almaden NII Shonan meeting, Japan Jan. 2012 1-1 The distributed streaming model (a.k.a.

More information

From Adversaries to Algorithms. Troy Lee Rutgers University

From Adversaries to Algorithms. Troy Lee Rutgers University From Adversaries to Algorithms Troy Lee Rutgers University Quantum Query Complexity As in classical complexity, it is difficult to show lower bounds on the time or number of gates required to solve a problem

More information

Optimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers

Optimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex

More information

Exponential Separation of Quantum Communication and Classical Information

Exponential Separation of Quantum Communication and Classical Information Exponential Separation of Quantum Communication and Classical Information Dave Touchette IQC and C&O, University of Waterloo, and Perimeter Institute for Theoretical Physics jt. work with Anurag Anshu

More information

Notes for Lecture 3... x 4

Notes for Lecture 3... x 4 Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 18, 2012 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial

More information

Lecture 3: AC 0, the switching lemma

Lecture 3: AC 0, the switching lemma Lecture 3: AC 0, the switching lemma Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: Meng Li, Abdul Basit 1 Pseudorandom sets We start by proving

More information

An Introduction to Quantum Information and Applications

An Introduction to Quantum Information and Applications An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded

More information

4. Algebra and Duality

4. Algebra and Duality 4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone

More information

SDP Relaxations for MAXCUT

SDP Relaxations for MAXCUT SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP

More information

An Introduction to Randomized algorithms

An Introduction to Randomized algorithms An Introduction to Randomized algorithms C.R. Subramanian The Institute of Mathematical Sciences, Chennai. Expository talk presented at the Research Promotion Workshop on Introduction to Geometric and

More information

Kirk Pruhs. Green Computing Algorithmics. Talk 1: Energy Efficient Circuit Design ADFOCS 2015

Kirk Pruhs. Green Computing Algorithmics. Talk 1: Energy Efficient Circuit Design ADFOCS 2015 Kirk Pruhs Green Computing Algorithmics Talk 1: Energy Efficient Circuit Design ADFOCS 2015 Motivation: Moore s Gap Moore s Law: Transistor density doubles every 18-24 months. Computer performance has

More information

Approximation norms and duality for communication complexity lower bounds

Approximation norms and duality for communication complexity lower bounds Approximation norms and duality for communication complexity lower bounds Troy Lee Columbia University Adi Shraibman Weizmann Institute From min to max The cost of a best algorithm is naturally phrased

More information

Introduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm

Introduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut

More information

arxiv: v3 [cs.cc] 28 Jun 2015

arxiv: v3 [cs.cc] 28 Jun 2015 Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent arxiv:156.2936v3 [cs.cc] 28 Jun 215 Penghui Yao CWI, Amsterdam phyao1985@gmail.com September

More information

Nonnegative Rank vs. Binary Rank

Nonnegative Rank vs. Binary Rank CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE 06, Article, pages 3 http://cjtcs.cs.uchicago.edu/ Nonnegative Rank vs. Binary Rank Thomas Watson Received February 3, 04; Revised August 5, 05, and on February

More information

Boolean Algebra. Philipp Koehn. 9 September 2016

Boolean Algebra. Philipp Koehn. 9 September 2016 Boolean Algebra Philipp Koehn 9 September 2016 Core Boolean Operators 1 AND OR NOT A B A and B 0 0 0 0 1 0 1 0 0 1 1 1 A B A or B 0 0 0 0 1 1 1 0 1 1 1 1 A not A 0 1 1 0 AND OR NOT 2 Boolean algebra Boolean

More information

Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments

Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments François Le Gall The University of Tokyo Technical version available at arxiv:1407.0085 [quant-ph]. Background. Triangle finding

More information

Lagrange duality. The Lagrangian. We consider an optimization program of the form

Lagrange duality. The Lagrangian. We consider an optimization program of the form Lagrange duality Another way to arrive at the KKT conditions, and one which gives us some insight on solving constrained optimization problems, is through the Lagrange dual. The dual is a maximization

More information

Towards a resource theory of contextuality

Towards a resource theory of contextuality Towards a resource theory of contextuality Samson Abramsky1 Rui Soares Barbosa1 Shane Mansfield2 1 Department of Computer Science, University of Oxford {rui.soares.barbosa,samson.abramsky}@cs.ox.ac.uk

More information

An improved lower bound for the randomized decision tree complexity of recursive majority

An improved lower bound for the randomized decision tree complexity of recursive majority An improved lower bound for the randomized decision tree complexity of recursive majority Nikos Leonardos National and Kapodistrian University of Athens Department of Informatics and Telecommunications

More information

Lecture notes on OPP algorithms [Preliminary Draft]

Lecture notes on OPP algorithms [Preliminary Draft] Lecture notes on OPP algorithms [Preliminary Draft] Jesper Nederlof June 13, 2016 These lecture notes were quickly assembled and probably contain many errors. Use at your own risk! Moreover, especially

More information

Settling the Query Complexity of Non-Adaptive Junta Testing

Settling the Query Complexity of Non-Adaptive Junta Testing Settling the Query Complexity of Non-Adaptive Junta Testing Erik Waingarten, Columbia University Based on joint work with Xi Chen (Columbia University) Rocco Servedio (Columbia University) Li-Yang Tan

More information

A Dichotomy. in in Probabilistic Databases. Joint work with Robert Fink. for Non-Repeating Queries with Negation Queries with Negation

A Dichotomy. in in Probabilistic Databases. Joint work with Robert Fink. for Non-Repeating Queries with Negation Queries with Negation Dichotomy for Non-Repeating Queries with Negation Queries with Negation in in Probabilistic Databases Robert Dan Olteanu Fink and Dan Olteanu Joint work with Robert Fink Uncertainty in Computation Simons

More information

Approximate Farkas Lemmas in Convex Optimization

Approximate Farkas Lemmas in Convex Optimization Approximate Farkas Lemmas in Convex Optimization Imre McMaster University Advanced Optimization Lab AdvOL Graduate Student Seminar October 25, 2004 1 Exact Farkas Lemma Motivation 2 3 Future plans The

More information

Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method

Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Robert M. Freund March, 2004 2004 Massachusetts Institute of Technology. The Problem The logarithmic barrier approach

More information

On Quantum vs. Classical Communication Complexity

On Quantum vs. Classical Communication Complexity On Quantum vs. Classical Communication Complexity Dmitry Gavinsky Institute of Mathematics, Praha Czech Academy of Sciences Introduction Introduction The setting of communication complexity is one of the

More information

Lagrangian Duality Theory

Lagrangian Duality Theory Lagrangian Duality Theory Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Chapter 14.1-4 1 Recall Primal and Dual

More information

arxiv: v4 [cs.cc] 28 Apr 2014

arxiv: v4 [cs.cc] 28 Apr 2014 Hardness Amplification and the Approximate Degree of Constant-Depth Circuits Mark Bun mbun@seas.harvard.edu Justin Thaler jthaler@fas.harvard.edu arxiv:1311.1616v4 [cs.cc] 28 Apr 2014 Abstract We establish

More information

COMPUTATIONAL COMPLEXITY

COMPUTATIONAL COMPLEXITY COMPUTATIONAL COMPLEXITY A Modern Approach SANJEEV ARORA Princeton University BOAZ BARAK Princeton University {Щ CAMBRIDGE Щ0 UNIVERSITY PRESS Contents About this book Acknowledgments Introduction page

More information

Quantum algorithms (CO 781/CS 867/QIC 823, Winter 2013) Andrew Childs, University of Waterloo LECTURE 13: Query complexity and the polynomial method

Quantum algorithms (CO 781/CS 867/QIC 823, Winter 2013) Andrew Childs, University of Waterloo LECTURE 13: Query complexity and the polynomial method Quantum algorithms (CO 781/CS 867/QIC 823, Winter 2013) Andrew Childs, University of Waterloo LECTURE 13: Query complexity and the polynomial method So far, we have discussed several different kinds of

More information

Algorithms and Theory of Computation. Lecture 13: Linear Programming (2)

Algorithms and Theory of Computation. Lecture 13: Linear Programming (2) Algorithms and Theory of Computation Lecture 13: Linear Programming (2) Xiaohui Bei MAS 714 September 25, 2018 Nanyang Technological University MAS 714 September 25, 2018 1 / 15 LP Duality Primal problem

More information

Lecture 5. x 1,x 2,x 3 0 (1)

Lecture 5. x 1,x 2,x 3 0 (1) Computational Intractability Revised 2011/6/6 Lecture 5 Professor: David Avis Scribe:Ma Jiangbo, Atsuki Nagao 1 Duality The purpose of this lecture is to introduce duality, which is an important concept

More information

Learning and Testing Submodular Functions

Learning and Testing Submodular Functions Learning and Testing Submodular Functions Grigory Yaroslavtsev http://grigory.us Slides at http://grigory.us/cis625/lecture3.pdf CIS 625: Computational Learning Theory Submodularity Discrete analog of

More information

. An introduction to Quantum Complexity. Peli Teloni

. An introduction to Quantum Complexity. Peli Teloni An introduction to Quantum Complexity Peli Teloni Advanced Topics on Algorithms and Complexity µπλ July 3, 2014 1 / 50 Outline 1 Motivation 2 Computational Model Quantum Circuits Quantum Turing Machine

More information

The Zero-Error Randomized Query Complexity of the Pointer Function

The Zero-Error Randomized Query Complexity of the Pointer Function The Zero-Error Randomized Query Complexity of the Pointer Function Jaikumar Radhakrishnan 1 and Swagato Sanyal 2 1 Tata Institute of Fundamental Research, India jaikumar@tifr.res.in 2 Tata Institute of

More information

Computer Science Project: Report

Computer Science Project: Report Computer Science Project: Report 2010-2011 The composition of the group: I. GROUP MEMBERS AND VISITORS 1. Principal Investigators : Rahul Jain, Hartmut Klauck (since April 2010), Miklos Santha. 2. Post-docs

More information

CSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication

CSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication CSE20: Discrete Mathematics for Computer Science Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication Disjunctive normal form Example: Let f (x, y, z) =xy z. Write this function in DNF. Minterm

More information