The pattern matrix method

SIAM Journal on Computing

Volumn 40, Issue 6, 2011, Pages 1969-2000

  Sherstov, Alexander A ^a  

^a University of Texas at Austin   (United States)

Author keywords

Approximate rank; Approximate trace norm; Approximation and sign representation of Boolean functions by real polynomials; Bounded error communication complexity; Degree discrepancy theorem; Discrepancy; Linear programming duality; Pattern matrix method; Quantum communication complexity

Indexed keywords

APPROXIMATE RANK; BOUNDED-ERROR COMMUNICATION; DEGREE/DISCREPANCY THEOREM; DISCREPANCY; LINEAR PROGRAMMING DUALITY; PATTERN MATRIX; QUANTUM COMMUNICATION COMPLEXITY; TRACE-NORMS;

BOOLEAN FUNCTIONS; QUANTUM COMMUNICATION; QUANTUM ENTANGLEMENT; REAL VARIABLES;

COMMUNICATION;

EID: 84855598669     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080733644     Document Type: Conference Paper

References (66)

1. S. AARONSON AND Y. SHI, Quantum lower bounds for the collision and the element distinctness problems, J. ACM, 51(2004), pp. 595-605.
2. A. AMBAINIS, Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range, Theory Comput., 1(2005), pp. 37-46.
3. A. AMBAINIS, L. J. SCHULMAN, A. TA-SHMA, U. V. VAZIRANI, AND A. WIGDERSON, The quantum communication complexity of sampling, SIAM J. Comput., 32(2003), pp. 1570-1585.
4. J. ASPNES, R. BEIGEL, M. L. FURST, AND S. RUDICH, The expressive power of voting polynomials, Combinatorica, 14(1994), pp. 135-148.
5. R. BEALS, H. BUHRMAN, R. CLEVE, M. MOSCA, AND R. DE WOLF, Quantum lower bounds by polynomials, J. ACM, 48(2001), pp. 778-797.
6. o, in Proceedings of the 50th Symposium on Foundations of Computer Science (FOCS), IEEE, 2009, to appear.
7. R. BEIGEL, Perceptrons, PP, and the polynomial hierarchy, Comput. Complexity, 4(1994), pp. 339-349.
8. H. BUHRMAN, R. CLEVE, R. DE WOLF, AND C. ZALKA, Bounds for small-error and zero-error quantum algorithms, in Proceedings of the 40th Symposium on Foundations of Computer Science (FOCS), IEEE, 1999, pp. 358-368. (Pubitemid 30539967)
9. H. BUHRMAN, R. CLEVE, AND A. WIGDERSON, Quantum vs. classical communication and computation, in Proceedings of the 13th Symposium on Theory of Computing (STOC), ACM, 1998, pp. 63-68.
10. H. BUHRMAN AND R. DE WOLF, Complexity measures and decision tree complexity: A survey, Theoret. Comput. Sci., 288(2002), pp. 21-43.
11. H. BUHRMAN, N. K. VERESHCHAGIN, AND R. DE WOLF, On computation and communication with small bias, in Proceedings of the 22nd Conference on Computational Complexity (CCC), IEEE, 2007, pp. 24-32. (Pubitemid 47485121)
12. H. BUHRMAN AND R. DE WOLF, Communication complexity lower bounds by polynomials, in Proceedings of the 16th Conference on Computational Complexity (CCC), IEEE, 2001, pp. 120-130. (Pubitemid 32795593)
13. A. CHAKRABARTI, Y. SHI, A. WIRTH, AND A. C. YAO, Informational complexity and the direct sum problem for simultaneous message complexity, in Proceedings of the 42nd Symposium on Foundations of Computer Science (FOCS), IEEE, 2001, pp. 270-278. (Pubitemid 33068387)
14. A. CHATTOPADHYAY AND A. ADA, Multiparty communication complexity of disjointness, in Electronic Colloquium on Computational Complexity (ECCC), report TR08-002, 2008.
15. M. DAVID AND T. PITASSI, Separating NOF communication complexity classes RP and NP, in Electronic Colloquium on Computational Complexity (ECCC), report TR08-014, 2008.
16. M. DAVID, T. PITASSI, AND E. VIOLA, Improved separations between nondeterministic and randomized multiparty communication, in Proceedings of the 12th International Workshop on Randomization and Computation (RANDOM), 2008, pp. 371-384.
17. R. A. DEVORE AND G. G. LORENTZ, Constructive Approximation, Vol. 303, Springer-Verlag, Berlin, 1993.
18. Y. FREUND, Boosting a weak learning algorithm by majority, Inf. Comput., 121(1995), pp. 256-285.
19. D. GAVINSKY, J. KEMPE, I. KERENIDIS, R. RAZ, AND R. DE WOLF, Exponential separations for one-way quantum communication complexity, with applications to cryptography, in Proceedings of the 39th Symposium on Theory of Computing (STOC), ACM, 2007, pp. 516-525. (Pubitemid 47630771)
20. M. GOLDMANN, J. HÅSTAD, AND A. A. RAZBOROV, Majority gates vs. general weighted threshold gates, Comput. Complexity, 2(1992), pp. 277-300.
21. A. HAJNAL, W. MAASS, P. PUDLÁK, M. SZEGEDY, AND G. TURÁN, Threshold circuits of bounded depth, J. Comput. System Sci., 46(1993), pp. 129-154.
22. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1986.
23. P. HØYER AND R. DE WOLF, Improved quantum communication complexity bounds for disjointness and equality, in Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2002, pp. 299-310.
24. A. D. IOFFE AND V. M. TIKHOMIROV, Duality of convex functions and extremum problems, Russian Math. Surveys, 23(1968), pp. 53-124.
25. J. KAHN, N. LINIAL, AND A. SAMORODNITSKY, Inclusion-exclusion: Exact and approximate, Combinatorica, 16(1996), pp. 465-477. (Pubitemid 126324260)
26. B. KALYANASUNDARAM AND G. SCHNITGER, The probabilistic communication complexity of set intersection, SIAM J. Discrete Math., 5(1992), pp. 545-557.
27. M. J. KEARNS, R. E. SCHAPIRE, AND L. SELLIE, Toward efficient agnostic learning, Mach. Learn., 17(1994), pp. 115-141.
28. H. KLAUCK, Lower bounds for quantum communication complexity, in Proceedings of the 42nd Symposium on Foundations of Computer Science (FOCS), IEEE, 2001, pp. 288-297. (Pubitemid 33068389)
29. H. KLAUCK, Lower bounds for quantum communication complexity, SIAM J. Comput., 37(2007), pp. 20-46. (Pubitemid 351321986)
30. H. KLAUCK, A. NAYAK, A. TA-SHMA, AND D. ZUCKERMAN, Interaction in quantum communication and the complexity of set disjointness, in Proceedings of the 33rd Symposium on Theory of Computing (STOC), ACM, 2001, pp. 124-133. (Pubitemid 32865725)
31. A. R. KLIVANS, R. O'DONNELL, AND R. A. SERVEDIO, Learning intersections and thresholds of halfspaces, J. Comput. System Sci., 68(2004), pp. 808-840.
32. Õ(n1/3), J. Comput. System Sci., 68(2004), pp. 303-318.
33. A. R. KLIVANS AND R. A. SERVEDIO, Toward attribute efficient learning of decision lists and par it ies, J. Mach. Learn. Res., 7(2006), pp. 587-602. (Pubitemid 43668114)
34. A. R. KLIVANS AND A. A. SHERSTOV, A lower bound for agnostically learning disjunctions, in Proceedings of the 20th Conference on Learning Theory (COLT), 2007, pp. 409-423.
35. A. R. KLIVANS AND A. A. SHERSTOV, Unconditional lower bounds for learning intersections of halfspaces, Mach. Learn., 69(2007), pp. 97-114. (Pubitemid 47574311)
36. M. KRAUSE AND P. PUDLÁK, On the computational power of depth-2 circuits with threshold and modulo gates, Theoret. Comput. Sci., 174(1997), pp. 137-156. (Pubitemid 127452780)
37. M. KRAUSE AND P. PUDLÁK, Computing Boolean functions by polynomials and threshold circuits, Comput. Complexity, 7(1998), pp. 346-370. (Pubitemid 128344060)
38. I. KREMER, Quantum Communication, Master's thesis, Hebrew University, Computer Science Department, 1995.
39. E. KUSHILEVITZ AND N. NISAN, Communication Complexity, Cambridge University Press, New York, 1997.
40. T. LEE AND A. SHRAIBMAN, Disjointness is hard in the multiparty number-on-the-forehead model, Comput. Complexity, 18(2009), pp. 309-336.
41. N. LINIAL AND A. SHRAIBMAN, Lower bounds in communication complexity based on factorization norms, Random. Struc. Algorithms, 34(2009), pp. 368-394.
42. N. LINIAL AND A. SHRAIBMAN, Learning complexity vs.communication complexity, Combinatorics Probab. Comput., 18(2009), pp. 227-245.
43. L. LOVÁSZ AND M. E. SAKS, Lattices, möbius functions and communication complexity, in Proceedings of the 29th Symposium on Foundations of Computer Science (FOCS), IEEE, 1988, pp. 81-90.
44. K. MEHLHORN AND E. M. SCHMIDT, Las Vegas is better than determinism in VLSI and distributed computing, in Proceedings of the 14th Symposium on Theory of Computing (STOC), ACM, 1982, pp. 330-337.
45. M. L. MINSKY AND S. A. PAPERT, Perceptrons: An Introduction to Computational Geometry, MIT Press, Cambridge, MA, 1969.
46. J. MYHILL AND W. H. KAUTZ, On the size of weights required for linear-input switching functions, IRE Trans. on Electron. Comput., 10(1961), pp. 288-290.
47. N. NISAN, The communication complexity of threshold gates, in Combinatorics, Paul Erdös is Eighty, 1993, pp. 301-315.
48. N. NISAN AND M. SZEGEDY, On the degree of Boolean functions as real polynomials, Comput. Complexity, 4(1994), pp. 301-313.
49. R. O'DONNELL AND R. A. SERVEDIO, New degree bounds for polynomial threshold functions, in Proceedings of the 35th Symposium on Theory of Computing (STOC), ACM, 2003, pp. 325-334.
50. R. PATURI, On the degree of polynomials that approximate symmetric Boolean functions, in Proceedings of the 24th Symposium on Theory of Computing (STOC), ACM, 1992, pp. 468-474. (Pubitemid 23608065)
51. R. PATURI AND J. SIMON, Probabilistic communication complexity, J. Comput. System Sci., 33(1986), pp. 106-123.
52. V. V. PODOLSKII, Perceptrons of large weight, in Proceedings of the Second International Computer Science Symposium in Russia (CSR), 2007, pp. 328-336. (Pubitemid 350271281)
53. V. V. PODOLSKII, A uniform lower bound on weights of perceptrons, in Proceedings of the Third International Computer Science Symposium in Russia (CSR), 2008, pp. 261-272. (Pubitemid 351776136)
54. R. RAZ, Fourier analysis for probabilistic communication complexity, Comput. Complexity, 5(1995), pp. 205-221. (Pubitemid 126090315)
55. A. A. RAZBOROV, On the distributional complexity of disjointness, Theoret. Comput. Sci., 106(1992), pp. 385-390. (Pubitemid 23607400)
56. A. A. RAZBOROV, Quantum communication complexity of symmetric predicates, Izv. Math., 67(2003), pp. 145-159. (Pubitemid 44357385)
57. A. SCHRIJVER, Theory of Linear and Integer Programming, John Wiley & Sons, New York, 1998.
58. A. A. SHERSTOV, Approximate inclusion-exclusion for arbitrary symmetric functions, Comput. Complexity, 18(2009), pp. 219-247.
59. A. A. SHERSTOV, Halfspace matrices, Comput. Complexity, 17(2008), pp. 149-178. Preliminary version in 22nd CCC, 2007.
60. 0 from depth-2 majority circuits, SIAM J. Comput., 38(2009), pp. 2113-2129. Preliminary version in 39th STOC, 2007.
61. A. A. SHERSTOV, Communication lower bounds using dual polynomials, Bull. Eur. Assoc. Theor. Comput. Sci., 95(2008), pp. 59-93.
62. Y. SHI AND Y. ZHU, Quantum communication complexity of block-composed functions, http://arxiv.org/abs/0710.0095v4.
63. N. K. VERESHCHAGIN, Lower bounds for perceptrons solving some separation problems and oracle separation of AM from PP, in Proceedings of the Third Israel Symposium on Theory of Computing and Systems (ISTCS), 1995, pp. 46-51.
64. R. DE WOLF, A note on quantum algorithms and the minimal degree of ∈-error polynomials for symmetric functions, Quantum Inf. Comput., 8(2008), pp. 943-950.
65. A. C. YAO, Some complexity questions related to distributive computing, in Proceedings of the 11th Symposium on Theory of Computing (STOC), ACM, 1979, pp. 209-213.
66. A. C. YAO, Quantum circuit complexity, in Proceedings of the 34th Symposium on Foundations of Computer Science (FOCS), IEEE, 1993, pp. 352-361.