Abstract
We show that most algebraic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity theory (GCT), including: the partial derivatives technique (Nisan–Wigderson), the results of Razborov and Smolensky on AC 0[p], multilinear formula and circuit size lower bounds (Raz et al.), the degree bound (Strassen, Baur–Strassen), the connected components technique (Ben-Or, Steele–Yao), depth 3 algebraic circuit lower bounds over finite fields (Grigoriev–Karpinski), lower bounds on permanent versus determinant (Mignon–Ressayre, Landsberg–Manivel–Ressayre), lower bounds on matrix multiplication (Bürgisser–Ikenmeyer, Landsberg–Ottaviani) (these last two were already known to fit into GCT), the chasms at depth 3 and 4 (Gupta–Kayal–Kamath–Saptharishi, Agrawal–Vinay, Koiran, Tavenas), matrix rigidity (Valiant) and others. That is, the original proofs, with what is often just a little extra work, already provide representation-theoretic obstructions in the sense of GCT for their respective lower bounds. This enables us to expose a new viewpoint on GCT, whereby it is a natural unification of known results and broad generalization of known techniques. It also shows that the framework of GCT is at least as powerful as previous methods, and gives many new proofs-of-concept that GCT can indeed provide significant asymptotic lower bounds. This new viewpoint also opens up the possibility of fruitful two-way interactions between previous results and the new methods of GCT; we provide several concrete suggestions of such interactions. For example, the representation-theoretic viewpoint of GCT naturally provides new properties to consider in the search for new lower bounds.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Scott Aaronson & Andrew Drucker (2009). Impagliazzo’s worlds in arithmetic complexity. Talk presented at the Workshop on Complexity and Cryptography: Status of Impagliazzo’s Worlds, Center for Computational Intractability, Princeton, NJ, June 5, 2009. Slides available at http://www.scottaaronson.com/talks/arith.ppt.
B. Adsul, Milind Sohoni & K. V. Subrahmanyam (2009). Quantum deformations of the restriction of \({GL_{mn}(\mathbb{C})}\)-modules to \({GL_m(\mathbb{C}) \times GL_n(\mathbb{C})}\). arXiv:0905.0094 [math.RT].
Manindra Agrawal (2005). Proving lower bounds via pseudo-random generators. In FSTTCS 2005: Foundations of software technology and theoretical computer science, volume 3821 of Lecture Notes in Computer Science, 92–105. Springer, Berlin.
Manindra Agrawal & V. Vinay (2008). Arithmetic Circuits: A Chasm at Depth Four. In FOCS ’08: 49th, Annual IEEE Symposium on Foundations of Computer Science 67–75. IEEE Computer Society.
Eric Allender (1999). The permanent requires large uniform threshold circuits. Chicago J. Theoret. Comput. Sci. Art. 7.
Eric Allender & Vivek Gore (1994). A uniform circuit lower bound for the permanent. SIAM J. Comput 23(5), 1026–1049.
Saugata Basu, Richard Pollack & Marie-Françoise Roy (2006). Algorithms in real algebraic geometry, volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, 2nd edition.
Walter Baur & Volker Strassen (1983). The complexity of partial derivatives. Theoret. Comput. Sci. 22(3), 317–330.
Michael Ben-Or (1983). Lower bounds for algebraic computation trees. In STOC ’83: 15th Annual ACM Symposium on Theory of Computing, 80–86. ACM.
Dario Bini (1980) Relations between exact and approximate bilinear algorithms. Applications. Calcolo 17(1): 87–97
Dario Bini, Milvio Capovani, Francesco Romani & Grazia Lotti (1979). O(n 2.7799) complexity for n × n approximate matrix multiplication. Inform. Process. Lett. 8(5), 234–235.
Anders Björner, László Lovász & Andrew C. C. Yao (1992). Linear decision trees: volume estimates and topological bounds. In STOC ’92: 24th Annual ACM Symposium on Theory of Computing, 170–177. ACM.
Markus Bläser (1999). A \({\frac{5}{2} n^2}\) -lower bound for the rank of n × n-matrix multiplication over arbitrary fields. In FOCS ’99: 40th Annual IEEE Symposium on Foundations of Computer Science, 45–50. IEEE Computer Soc., Los Alamitos, CA.
Jonah Blasiak (2012). Kronecker coefficients for one hook shape. arXiv:1209.2018 [math.CO].
Jonah Blasiak, Ketan D. Mulmuley & Milind Sohoni (2015). Geometric complexity theory IV: nonstandard quantum group for the Kronecker problem. Mem. Amer. Math. Soc. 235(1109).
Manuel Blum & Silvio Micali (1984). How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput 13(4), 850–864.
Jacek Bochnak, Michel Coste & Marie-Françoise Roy (1998). Real algebraic geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3). Springer-Verlag, Berlin.
Wieb Bosma, John Cannon & Catherine Playoust (1997). The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3-4), 235–265. Computational algebra and number theory (London, 1993).
Michel Brion (2011). Invariant Hilbert schemes. arXiv:1102.0198v2 [math.AG].
Harry Buhrman, Lance Fortnow & Thomas Thierauf (1998). Nonrelativizing separations. In CCC ’98:13th Conference on Computational Complexity, 8–12. IEEE Computer Soc., Los Alamitos, CA.
Peter Bürgisser (2004) The complexity of factors of multivariate polynomials. Found. Comput. Math. 4(4), 369–396
Peter Bürgisser, Matthias Christandl & Christian Ikenmeyer (2011a). Nonvanishing of Kronecker coefficients for rectangular shapes. Adv. Math. 227(5), 2082–2091.
Peter Bürgisser, Michael Clausen & M. Amin Shokrollahi (1997). Algebraic complexity theory, volume 315 of Grundlehren der Mathematischen Wissenschaften. Springer-Verlag, Berlin.
Peter Bürgisser & Christian Ikenmeyer (2009). A max-flow algorithm for positivity of Littlewood–Richardson coefficients. In 21st Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), Discrete Math. Theor. Comput. Sci. Proc., AJ. Assoc. Discrete Math. Theor. Comput. Sci., Nancy.
Peter Bürgisser & Christian Ikenmeyer (2011). Geometric complexity theory and tensor rank. In STOC ’11: 43rd Annual ACM Symposium on Theory of Computing, 509–518. ACM.
Peter Bürgisser & Christian Ikenmeyer (2013). Deciding Positivity of Littlewood–Richardson Coefficients. SIAM J. Discrete Math 27, 1639–1681.
Peter Bürgisser & Christian Ikenmeyer (2013). Explicit lower bounds via geometric complexity theory. In STOC ’13: 45th Annual ACM Symposium on Theory of Computing, 141–150. ACM, New York.
Peter Bürgisser, J. M. Landsberg, Laurent Manivel & Jerzy Weyman (2011b). An overview of mathematical issues arising in the Geometric Complexity Theory approach to \({\sf{VP} \neq \sf{VNP}}\) . SIAM J. Comput 40(4), 1179–1209.
Samuel Buss & Ryan Williams (2012). Limits on Alternation-Trading Proofs for Time-Space Lower Bounds. In CCC ’12: 27th IEEE Conference on Computational Complexity, 181–191. IEEE Computer Society.
Patricia J. Carstensen (1983a). Complexity of some parametric integer and network programming problems. Math. Programming 26(1), 64–75.
Patricia June Carstensen (1983b). The complexity of some problems in parametric linear and combinatorial programming. Ph.D. thesis, University of Michigan—Ann Arbor, Ann Arbor, MI.
Claude Chevalley & Henri Cartan (1955–1956). Schémas normaux; morphismes; ensembles constructibles. In Séminaire Henri Cartan, tome 8, Exp. No. 7, 1–10.
Stephen A. Cook (1973). A hierarchy for nondeterministic time complexity. J. Comput. System Sci. 7, 343–353. STOC ’72: 4th Annual ACM Symposium on Theory of Computing.
Don Coppersmith & Shmuel Winograd (1990). Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9(3), 251–280.
David Cox, John Little & Donal O’Shea (1997). Ideals, varieties, and algorithms. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 2nd edition.
V. I. Danilov (1994). Algebraic varieties and schemes. In Algebraic geometry, I, volume 23 of Encyclopaedia Math. Sci., 167–297. Springer, Berlin.
Scott Diehl, Dieter van Melkebeek & Ryan Williams (2011). An improved time-space lower bound for tautologies. J. Comb. Optim. 22(3), 325–338.
Rodney G. Downey & Michael R. Fellows (1999). Parameterized complexity. Monographs in Computer Science. Springer-Verlag, New York.
David Eisenbud (1995). Commutative algebra, volume 150 of Graduate Texts in Mathematics. Springer-Verlag, New York.
Ismor Fischer (1994) Sums of like powers of multivariate linear forms. Math. Mag. 67(1): 59–61
Lance Fortnow (2000). Time-space tradeoffs for satisfiability. J. Comput. System Sci. 60(2, part 2), 337–353.
Lance Fortnow, Richard Lipton, Dieter van Melkebeek & Anastasios Viglas (2005). Time-space lower bounds for satisfiability. J. Assoc. Comput. Mach. 52(6), 835–865.
William Fulton & Joe Harris (1991). Representation theory, volume 129 of Graduate Texts in Mathematics. Springer-Verlag, New York.
GAP (2014). GAP – Groups, Algorithms, and Programming, Version 4.7.6. The GAP Group. URL http://www.gap-system.org.
Fulvio Gesmundo, Jonathan Hauenstein, Christian Ikenmeyer & J. M. Landsberg (2013). Complexity of linear circuits and geometry. arXiv:1310.1362 [cs.CC].
Roe Goodman & Nolan R. Wallach (2009). Symmetry, representations, and invariants, volume 255 of Graduate Texts in Mathematics. Springer, Dordrecht.
Silvio Greco (1978). Normal varieties. Institutiones Mathematicae, IV. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London.
Bernhard Griesser (1986). Lower bounds for the approximative complexity. Theoret. Comput. Sci. 46(2-3), 329–338.
D. Grigoriev & A. Razborov (2000). Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. Appl. Algebra Engrg. Comm. Comput. 10(6), 465–487.
Dima Grigoriev & Marek Karpinski (1998). An exponential lower bound for depth 3 arithmetic circuits. In STOC ’98: 30th Annual ACM Symposium on Theory of Computing , 577–582. ACM.
Joshua A. Grochow (2012). Symmetry and Equivalence Relations in Classical and Geometric Complexity Theory. Ph.D. thesis, University of Chicago, Chicago, IL.
Joshua A. Grochow (2014). Unifying known lower bounds via geometric complexity theory (extended abstract). In CCC ’14: 29th IEEE Conference on Computational Complexity. IEEE.
Alexander Grothendieck (1964). Éléments de géométrie algébrique. IV. Étude locale des schémas et des morphismes de schémas. I. Inst. Hautes Études Sci. Publ. Math. (20), 259.
Alexander Grothendieck (1995). Techniques de construction et théorèmes d’existence en géométrie algébrique. IV. Les schémas de Hilbert. In Séminaire Bourbaki, Vol. 6, Exp. No. 221, 249–276. Soc. Math. France, Paris.
Ankit Gupta, Pritish Kamath, Neeraj Kayal & Ramprasad Saptharishi (2012). Approaching the chasm at depth four. Technical Report TR12-098, Electronic Colloquium on Computational Complexity.
Ankit Gupta, Pritish Kamath, Neeraj Kayal & Ramprasad Saptharishi (2013). Arithmetic circuits: A chasm at depth three. In FOCS ’13: 54th Annual IEEE Symposium on Foundations of Computer Science.
Robert M. Hardt (1980). Semi-algebraic local-triviality in semi-algebraic mappings. Amer. J. Math. 102(2), 291–302.
Juris Hartmanis & R. E. Stearns (1965). On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117, 285–306.
Jonathan D. Hauenstein, Christian Ikenmeyer & J. M. Landsberg (2013). Equations for lower bounds on border rank. Exp. Math. 22(4), 372–383.
Joos Heintz & C.-P. Schnorr (1982). Testing polynomials which are easy to compute. In Logic and algorithmic (Zurich, 1980), volume 30 of Monograph. Enseign. Math., 237–254. Univ. Genève, Geneva.
Joos Heintz & Malte Sieveking (1980). Lower bounds for polynomials with algebraic coefficients. Theoret. Comput. Sci.11(3), 321–330.
Christian Ikenmeyer (2012). Geometric complexity theory, tensor rank, and Littlewood–Richardson coefficients. Ph.D. thesis, Univ. Paderborn.URL http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466:2-10472.
Maurice Jansen & Rahul Santhanam (2012). Marginal hitting sets imply super-polynomial lower bounds for permanent. In ITCS ’12:3rd Annual ACM Innovations in Theoretical Computer Science , 496–506. ACM.
Maurice Jansen & Rahul Santhanam (2013). Permanent does not have succinct polynomial size arithmetic circuits of constant depth. Inform. and Comput. 222, 195–207.
Ravi Kannan (1982). Circuit-size lower bounds and nonreducibility to sparse sets. Inform. and Control 55(1-3), 40–56.
Neeraj Kayal (2011). Affine projections of polynomials. Technical Report TR11-061, Electronic Colloquium on Computational Complexity.
Pascal Koiran (2012). Arithmetic circuits: the chasm at depth four gets wider. Theoret. Comput. Sci. 448, 56–65.
Pascal Koiran & Sylvain Perifel (2009). A superpolynomial lower bound on the size of uniform non-constant-depth threshold circuits for the permanent. In CCC ’09: 24th Conference on Computational Complexity , 35–40. IEEE Computer Soc., Los Alamitos, CA.
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar & M.N. Jayalal Sarma (2009). Using Elimination Theory to construct Rigid Matrices. arXiv:0910.5301 [cs.CC].
Shrawan Kumar (2013). Geometry of orbits of permanents and determinants. Comment. Math. Helv. 88(3), 759–788.
J. M. Landsberg (2006). The border rank of the multiplication of 2 × 2 matrices is seven. J. Amer. Math. Soc. 19(2), 447–459.
J. M. Landsberg (2008). Geometry and the complexity of matrix multiplication. Bull. Amer. Math. Soc. (N.S.) 45(2), 247–284.
J. M. Landsberg (2014a). Geometric complexity theory: an introduction for geometers. Annali Dell’universitá di Ferrara 1–53. Preprint available as arXiv:1305.7387 [math.AG].
J. M. Landsberg (2014b). New lower bounds for the rank of matrix multiplication. SIAM J. Comput. 43(1), 144–149.
J. M. Landsberg & Giorgio Ottaviani (2011). New lower bounds for the border rank of matrix multiplication. arXiv:1112.6007 [cs.CC].
J. M. Landsberg, J. Taylor & N. K. Vishnoi (2003). The geometry of matrix rigidity. Technical Report GIT-CC-03-54, Georgia Institute of Technology.
Joseph M. Landsberg, Laurent Manivel & Nicolas Ressayre (2013). Hypersurfaces with degenerate duals and the geometric complexity theory program. Comment. Math. Helv. 88(2), 469–484.
Hông Vân Lê (2010). Constructing elusive functions with the help of evaluation mappings. arXiv:1011.2887v5 [math.LO].
Hông Vân Lê (2013). Lower bounds for the circuit size of partially homogeneous polynomials. arXiv:1302.3360 [cs.CC].
Guillaume Malod & Natacha Portier (2008). Characterizing Valiant’s algebraic complexity classes. J. Complexity 24(1), 16–38.
Alex Massarenti & Emanuele Raviolo (2012). The Rank of n × n Matrix Multiplication is at least \({{3n^{2}-2\sqrt{2}n^{3}/2-3n}}\) . arXiv:1211.6320 [cs.CC].
Hideyuki Matsumura (1980). Commutative algebra, volume 56 of Mathematics Lecture Note Series. Benjamin/Cummings Publishing Co., Inc., Reading, Mass., 2nd edition.
Thierry Mignon & Nicolas Ressayre (2004). A quadratic bound for the determinant and permanent problem. Int. Math. Res. Not. (79), 4241–4253.
Ketan Mulmuley (1999). Lower bounds in a parallel model without bit operations. SIAM J. Comput 28(4), 1460–1509 (electronic).
Ketan D. Mulmuley (2010). Explicit proofs and the flip. Technical report, Computer Science Department, The University of Chicago. URLhttp://gct.cs.uchicago.edu/gctflip.ps.
Ketan D. Mulmuley (2011a). Geometric Complexity Theory VI: the flip via positivity. Technical report, University of Chicago.
Ketan D. Mulmuley (2011b). On P vs. NP and Geometric Complexity Theory. J. Assoc. Comput. Mach. 58(2), Art. 5.
Ketan D. Mulmuley (2012). Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether’s Normalization Lemma. In FOCS ’12: 53rd Annual IEEE Symposium on Foundations of Computer Science, 629–638.
Ketan D. Mulmuley & Milind Sohoni (2001). Geometric complexity theory I: an approach to the P vs. NP and related problems. SIAM J. Comput 31(2), 496–526.
Ketan D. Mulmuley & Milind Sohoni (2008). Geometric complexity theory. II. Towards explicit obstructions for embeddings among class varieties. SIAM J. Comput 38(3), 1175–1206.
David Mumford (1976). Algebraic geometry I. Complex projective varieties, volume 221 of Grundlehren der Mathematischen Wissenschaften. Springer-Verlag, Berlin.
Katta G. Murty (1980). Computational complexity of parametric linear programming. Math. Programming 19(2), 213–219.
Noam Nisan & Avi Wigderson (1994). Hardness vs. randomness. J. Comput. System Sci. 49(2), 149–167.
Noam Nisan & Avi Wigderson (1996/97). Lower bounds on arithmetic circuits via partial derivatives. Comput. Complexity 6(3), 217–234.
Igor Pak & Greta Panova (2014). On the complexity of computing Kronecker coefficients. To appear in Computational Complexity. arXiv:1404.0653.
Ran Raz (2006). Separation of multilinear circuit and formula size. Theory Comput. 2, 121–135.
Ran Raz (2009). Multi-linear formulas for permanent and determinant are of super-polynomial size. J. Assoc. Comput. Mach. 56(2), Art. 8, 17.
Ran Raz (2010a). Elusive functions and lower bounds for arithmetic circuits. Theory Comput. 6, 135–177.
Ran Raz (2010b). Tensor-rank and lower bounds for arithmetic formulas. In STOC ’10: 42nd ACM Symposium on Theory of Computing, 659–666. ACM.
Ran Raz, Amir Shpilka & Amir Yehudayoff (2008). A lower bound for the size of syntactically multilinear arithmetic circuits. SIAM J. Comput 38(4), 1624–1647.
Ran Raz & Amir Yehudayoff (2009). Lower bounds and separations for constant depth multilinear circuits. Comput. Complexity 18(2), 171–207.
Alexander A. Razborov (1987). Lower bounds on the dimension of schemes of bounded depth in a complete basis containing the logical addition function. Mat. Zametki 41(4), 598–607, 623. English translation: Mathematical Notes of the Academy of Sci. of the USSR, 41(4):333–338, 1987.
Alexander A. Razborov (1995a). Bounded arithmetic and lower bounds in Boolean complexity. In Feasible mathematics, II (Ithaca, NY, 1992), volume 13 of Progr. Comput. Sci. Appl. Logic, 344–386. Birkhäuser Boston, Boston, MA.
Alexander A. Razborov (1995b). Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic. Izv. Ross. Akad. Nauk Ser. Mat. 59(1), 201–224. English translation: Izvestiya. Mathematics. 59(1):205–227, 1995.
Alexander A. Razborov & Steven Rudich (1997). Natural proofs. J. Comput. System Sci. 55(1, part 1), 24–35.
A. Schönhage (1981). Partial and total matrix multiplication. SIAM J. Comput 10(3), 434–455.
Karl Schwede (2012). Answer to “Is there a “geometric” intuition underlying the notion of normal varieties?”. Math Overflow, http://mathoverflow.net/a/109486/38434.
Igor R. Shafarevich (1994). Basic algebraic geometry. 1. Springer-Verlag, Berlin, 2nd edition.
Claude E. Shannon (1949). The synthesis of two-terminal switching circuits. Bell System Tech. J. 28, 59–98.
Amir Shpilka & Avi Wigderson (2001). Depth-3 arithmetic circuits over fields of characteristic zero. Comput. Complexity 10(1), 1–27.
Roman Smolensky (1987). Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In STOC ’87: 19th 19th Annual ACM Symposium on Theory of Computing, 77–82. ACM.
Andrew Stothers (2010). On the complexity of matrix multiplication. Ph.D. thesis, University of Edinburgh, Edinburgh, UK.
Volker Strassen (1972/73). Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten. Numer. Math. 20, 238–251.
Volker Strassen (1974). Polynomials with rational coefficients which are hard to compute. SIAM J. Comput 3, 128–149.
Volker Strassen (1983). Rank and optimal computation of generic tensors. Linear Algebra Appl. 52/53, 645–685.
Volker Strassen (1987). Relative bilinear complexity and matrix multiplication. j. reine angew. math. 375/376, 406–443.
Alfred Tarski (1948). A Decision Method for Elementary Algebra and Geometry. RAND Corporation, Santa Monica, Calif.
Sébastien Tavenas (2013). Improved Bounds for Reduction to Depth 4 and Depth 3. In MFCS ’13: 38th Symposium on Mathematical Foundations of Computer Science , 813–824.
Leslie G. Valiant (1977). Graph-theoretic arguments in low-level complexity. In MFCS ’77: 6th Symposium on Mathematical Foundations of Computer Science, volume 53 of Lecture Notes in Computer Science, 162–176. Springer.
Wolmer Vasconcelos (2005). Integral closure. Springer Monographs in Mathematics. Springer-Verlag, Berlin. Rees algebras, multiplicities, algorithms.
Virginia Vassilevska Williams (2012). Multiplying matrices faster than Coppersmith–Winograd. In STOC ’12: 44th Annual ACM Symposium on Theory of Computing, 887–898. ACM.
Ryan Williams (2006). Inductive time-space lower bounds for SAT and related problems. Comput. Complexity 15(4), 433–470.
Ryan Williams (2008). Time-space tradeoffs for counting NP solutions modulo integers. Comput. Complexity 17(2), 179–219.
Ryan Williams (2013). Natural proofs versus derandomization. In STOC ’13: 45th Annual ACM Symposium on Theory of Computing, 21–30. ACM, New York.
Ryan Williams (2014). Nonuniform ACC circuit lower bounds. J. Assoc. Comput. Mach. 61(1), Art. 2, 32.
Andrew Chi-Chih Yao (1982). Theory and applications of trapdoor functions. In FOCS ’82: 23rd IEEE Symposium on Foundations of Computer Science, 80–91. IEEE, New York.
Andrew Chi-Chih Yao (1991). Lower bounds for algebraic computation trees with integer inputs. SIAM J. Comput 20(4), 655–668.
Andrew Chi-Chih Yao (1997). Decision tree complexity and Betti numbers. J. Comput. System Sci. 55(1, part 1), 36–43.
Norman Zadeh (1973). A bad network problem for the simplex method and other minimum cost flow algorithms. Math. Programming 5, 255–266.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Grochow, J.A. Unifying Known Lower Bounds via Geometric Complexity Theory. comput. complex. 24, 393–475 (2015). https://doi.org/10.1007/s00037-015-0103-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-015-0103-x
Keywords
- Lower bounds
- circuit complexity
- algebraic complexity
- geometric complexity theory
- representation theory
- algebraic geometry