Skip to main content
SpringerLink
Log in

Extension Complexity of Formal Languages

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension complexity of formal languages. We prove several closure properties of languages admitting compact extended formulations. Furthermore, we give a sufficient machine characterization of compact languages. We demonstrate the utility of this machine characterization by obtaining upper bounds for polytopes for problems in nondeterministic logspace; lower bounds in streaming models; and upper bounds on extension complexities of several polytopes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. Assume some (arbitrary but fixed) encoding of boolean formulae as binary strings.

  2. Perfect Matching remains an easy problem despite exponential lower bound on the extension complexity of the perfect matching polytope. What does an exponential lower bound for the cut polytope tell us about the difficulty of the MAX-CUT problem?

  3. This usage, however, is common among number theorists.

  4. The description is required only to identify the function uniquely and need not be explicit.

References

  1. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62 (2), 17 (2015). https://doi.org/10.1145/2716307

    Article  MathSciNet  Google Scholar 

  2. Avis, D., Tiwary, H. R.: On the extension complexity of combinatorial polytopes. Math. Program. 153(1), 95–115 (2015). https://doi.org/10.1007/s10107-014-0764-2

    Article  MathSciNet  Google Scholar 

  3. Rothvoß, T.: The matching polytope has exponential extension complexity. J. ACM 64(6), 41:1–41:19 (2017). https://doi.org/10.1145/3127497

    Article  MathSciNet  Google Scholar 

  4. Braun, G., Jain, R., Lee, T., Pokutta, S.: Information-theoretic approximations of the nonnegative rank, ECCC:158 (2013)

  5. Chan, S. O., Lee, J. R., Raghavendra, P., Steurer, D.: Approximate constraint satisfaction requires large LP relaxations. In: FOCS ’13, 2013, pp. 350–359. https://doi.org/10.1109/FOCS.2013.45

  6. Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation limits of linear programs (Beyond Hierarchies). In: FOCS ’12, 2012, pp. 480–489

  7. Fawzi, H., Parrilo, P.: Exponential lower bounds on fixed-size psd rank and semidefinite extension complexity. arXiv:1311.2571 (2013)

  8. Briët, J., Dadush, D., Pokutta, S.: On the existence of 0/1 polytopes with high semidefinite extension complexity. Math. Program. 153(1), 179–199 (2015). https://doi.org/10.1007/s10107-014-0785-x

    Article  MathSciNet  Google Scholar 

  9. Lee, T., Theis, D. O.: Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix. arXiv:1203.3961 (2012)

  10. Lee, J. R., Raghavendra, P., Steurer, D.: Lower bounds on the size of semidefinite programming relaxations. In: STOC ’15, 2015, pp. 567–576. https://doi.org/10.1145/2746539.2746599

  11. Rothvoß, T.: Some 0/1 polytopes need exponential size extended formulations, vol. 142. https://doi.org/10.1007/s10107-012-0574-3 (2013)

  12. Ziegler, G. M.: Lectures on polytopes, Vol. 152 of Graduate texts in mathematics, Springer-Verlag (1995)

  13. Conforti, M., Cornuéjols, G., Zambelli, G.: Extended formulations in combinatorial optimization. Annals OR 204(1), 97–143 (2013)

    Article  MathSciNet  Google Scholar 

  14. Kaibel, V.: Extended formulations in combinatorial optimization. Optima 85, 2–7 (2011)

    Google Scholar 

  15. Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics 89(1-3), 3–44 (1998). https://doi.org/10.1016/S0166-218X(98)00136-X

    Article  MathSciNet  Google Scholar 

  16. Hartmanis, J., Immerman, N., Mahaney, S. R.: One-way log-tape reductions. In: FOCS ’78, 1978, pp. 65–72. https://doi.org/10.1109/SFCS.1978.31

  17. Hartmanis, J., Mahaney, S. R.: Languages simultaneously complete for one-way and two-way log-tape automata. SIAM J. Comput. 10(2), 383–390 (1981). https://doi.org/10.1137/0210027

    Article  MathSciNet  Google Scholar 

  18. Szepietowski, A.: Weak and strong one-way space complexity classes. Inf. Process. Lett. 68(6), 299–302 (1998). https://doi.org/10.1016/S0020-0190(98)00176-8

    Article  MathSciNet  Google Scholar 

  19. Margot, F.: Composition de polytopes combinatoires: une approche par projection, Ph.D. thesis, École polytechnique fédérale de Lausanne (1994)

  20. Conforti, M., Pashkovich, K.: The projected faces property and polyhedral relations. Math. Program. 156(1-2), 331–342 (2016). https://doi.org/10.1007/s10107-015-0882-5

    Article  MathSciNet  Google Scholar 

  21. Faenza, Y., Fiorini, S., Grappe, R., Tiwary, H. R.: Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153(1), 75–94 (2015). https://doi.org/10.1007/s10107-014-0755-3

    Article  MathSciNet  Google Scholar 

  22. Fiorini, S., Pashkovich, K.: Uncapacitated flow-based extended formulations. Math. Program. 153(1), 117–131 (2015). https://doi.org/10.1007/s10107-015-0862-9

    Article  MathSciNet  Google Scholar 

  23. Arora, S., Barak, B.: Computational complexity - a modern approach. Cambridge University Press, Cambridge (2009)

    Book  Google Scholar 

  24. Carr, R., Konjevod, G.: Polyhedral combinatorics. In: Greenberg, H.J. (ed.) Tutorials on emerging methodologies and applications in operations research, Vol. 76 of international series in operations research & management science, pp 2–1–2–46. Springer, New York (2005)

  25. Onn, S., Shlyk, V. A.: Some efficiently solvable problems over integer partition polytopes. Discret. Appl. Math. 180, 135–140 (2015)

    Article  MathSciNet  Google Scholar 

  26. de la Higuera, C., Oncina, J.: Inferring deterministic linear languages. In: COLT ’02, 2002, pp. 185–200. https://doi.org/10.1007/3-540-45435-7_13

  27. Babu, A., Limaye, N., Radhakrishnan, J., Varma, G.: Streaming algorithms for language recognition problems. Theor. Comput. Sci. 494, 13–23 (2013). https://doi.org/10.1016/j.tcs.2012.12.028

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The author would like to acknowledge the support of grant GA15-11559S of GAČR. We also thank Mateus De Oliveira Oliveira for finding a critical flaw in a previous proof of Theorem 7 and the anonymous referees for many valuable suggestions.

Author information

Authors and Affiliations

  1. KAM/ITI, Charles University, Malostranské nám. 25, 118 00, Prague 1, Czech Republic

    Hans Raj Tiwary

Authors
  1. Hans Raj Tiwary
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hans Raj Tiwary.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tiwary, H.R. Extension Complexity of Formal Languages. Theory Comput Syst 64, 735–753 (2020). https://doi.org/10.1007/s00224-019-09951-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-019-09951-x

Keywords

Search

Navigation