default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. M. Landsberg
Person information
- affiliation: Texas A&M University, College Station, Texas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j19]Austin Conner, Hang Huang, J. M. Landsberg:
Bad and Good News for Strassen's Laser Method: Border Rank of $\mathrm{Perm}_3$ and Strict Submultiplicativity. Found. Comput. Math. 23(6): 2049-2087 (2023)- 2022
- [j18]Austin Conner, Fulvio Gesmundo, Joseph M. Landsberg, Emanuele Ventura
:
Rank and border rank of Kronecker powers of tensors and Strassen's laser method. Comput. Complex. 31(1): 1 (2022) - 2019
- [j17]Luca Chiantini, Christian Ikenmeyer, J. M. Landsberg, Giorgio Ottaviani:
The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices. Exp. Math. 28(3): 322-327 (2019) - [j16]Fulvio Gesmundo, Joseph M. Landsberg:
Explicit Polynomial Sequences with Maximal Spaces of Partial Derivatives and a Question of K. Mulmuley. Theory Comput. 15: 1-24 (2019) - 2018
- [j15]Klim Efremenko, J. M. Landsberg, Hal Schenck, Jerzy Weyman:
The method of shifted partial derivatives cannot separate the permanent from the determinant. Math. Comput. 87(312): 2037-2045 (2018) - 2017
- [j14]J. M. Landsberg, Nicholas Ryder:
On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication. Exp. Math. 26(3): 275-286 (2017) - [j13]J. M. Landsberg, Mateusz Michalek:
On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry. SIAM J. Appl. Algebra Geom. 1(1): 2-19 (2017) - 2016
- [j12]Fulvio Gesmundo, Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg:
Complexity of Linear Circuits and Geometry. Found. Comput. Math. 16(3): 599-635 (2016) - 2015
- [j11]Shrawan Kumar, J. M. Landsberg:
Connections between conjectures of Alon-Tarsi, Hadamard-Howe, and integrals over the special unitary group. Discret. Math. 338(7): 1232-1238 (2015) - [j10]Joseph M. Landsberg, Giorgio Ottaviani:
New Lower Bounds for the Border Rank of Matrix Multiplication. Theory Comput. 11: 285-298 (2015) - 2014
- [j9]J. M. Landsberg:
New Lower Bounds for the Rank of Matrix Multiplication. SIAM J. Comput. 43(1): 144-149 (2014) - 2013
- [j8]Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg:
Equations for Lower Bounds on Border Rank. Exp. Math. 22(4): 372-383 (2013) - [j7]Jaroslaw Buczynski, Adam Ginensky, J. M. Landsberg:
Determinantal equations for secant varieties and the Eisenbud-Koh-Stillman conjecture. J. Lond. Math. Soc. 88(1): 1-24 (2013) - 2011
- [j6]Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman:
An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP. SIAM J. Comput. 40(4): 1179-1209 (2011) - 2010
- [j5]J. M. Landsberg, Zach Teitler:
On the Ranks and Border Ranks of Symmetric Tensors. Found. Comput. Math. 10(3): 339-366 (2010) - [j4]J. M. Landsberg:
P versus NP and geometry. J. Symb. Comput. 45(12): 1359-1377 (2010) - 2004
- [j3]J. M. Landsberg, Laurent Manivel, Bruce W. Westbury:
Series of Nilpotent Orbits. Exp. Math. 13(1): 13-29 (2004) - [j2]J. M. Landsberg, Laurent Manivel:
On the Ideals of Secant Varieties of Segre Varieties. Found. Comput. Math. 4(4): 397-422 (2004) - [j1]Majid Fozunbal, Steven W. McLaughlin, Ronald W. Schafer, J. M. Landsberg:
On Space-Time Coding in the Presence of Spatio-Temporal Correlation. IEEE Trans. Inf. Theory 50(9): 1910-1926 (2004)
Conference and Workshop Papers
- 2020
- [c2]Austin Conner, Joseph M. Landsberg, Fulvio Gesmundo, Emanuele Ventura:
Kronecker Powers of Tensors and Strassen's Laser Method. ITCS 2020: 10:1-10:28 - 2016
- [c1]Joseph M. Landsberg, Nicolas Ressayre:
Permanent v. Determinant: An Exponential Lower Bound Assuming Symmetry. ITCS 2016: 29-35
Informal and Other Publications
- 2023
- [i36]Hang Huang, J. M. Landsberg:
On Linear spaces of of matrices bounded rank. CoRR abs/2306.14428 (2023) - 2022
- [i35]Joachim Jelisiejew, J. M. Landsberg, Arpan Pal:
Concise tensors of minimal border rank. CoRR abs/2205.05713 (2022) - 2021
- [i34]J. M. Landsberg:
Algebraic Geometry and Representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science. CoRR abs/2108.06263 (2021) - 2020
- [i33]Austin Conner, Hang Huang, J. M. Landsberg:
Bad and good news for Strassen's laser method: Border rank of the 3x3 permanent and strict submultiplicativity. CoRR abs/2009.11391 (2020) - [i32]Runshi Geng, J. M. Landsberg:
On the geometry of geometric rank. CoRR abs/2012.04679 (2020) - 2019
- [i31]Austin Conner, Fulvio Gesmundo, Joseph M. Landsberg, Emanuele Ventura:
Kronecker powers of tensors and Strassen's laser method. CoRR abs/1909.04785 (2019) - [i30]Austin Conner, Fulvio Gesmundo, Joseph M. Landsberg, Emanuele Ventura:
Tensors with maximal symmetries. CoRR abs/1909.09518 (2019) - [i29]Austin Conner, Alicia Harper, J. M. Landsberg:
New lower bounds for matrix multiplication and the 3x3 determinant. CoRR abs/1911.07981 (2019) - [i28]J. M. Landsberg, Mateusz Michalek:
Towards finding hay in a haystack: explicit tensors of border rank greater than 2.02m in Cm ⊗ Cm ⊗ Cm. CoRR abs/1912.11927 (2019) - 2018
- [i27]Grey Ballard, Christian Ikenmeyer, J. M. Landsberg, Nick Ryder:
The geometry of rank decompositions of matrix multiplication II: 3×3 matrices. CoRR abs/1801.00843 (2018) - [i26]Austin Conner, Fulvio Gesmundo, Joseph M. Landsberg, Emanuele Ventura, Yao Wang:
A geometric study of Strassen's asymptotic rank conjecture and its variants. CoRR abs/1811.05511 (2018) - [i25]Joseph M. Landsberg:
The complexity of matrix multiplication: developments since 2014. Extended abstract of 2018 Oberwolfach Complexity meeting plenary lecture. CoRR abs/1811.11667 (2018) - 2017
- [i24]Fulvio Gesmundo, J. M. Landsberg:
Explicit polynomial sequences with maximal spaces of partial derivatives and a question of K. Mulmuley. CoRR abs/1705.03866 (2017) - 2016
- [i23]J. M. Landsberg, Mateusz Michalek:
On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry. CoRR abs/1601.08229 (2016) - [i22]J. M. Landsberg, Mateusz Michalek:
A $2n^2-log(n)-1$ lower bound for the border rank of matrix multiplication. CoRR abs/1608.07486 (2016) - [i21]Klim Efremenko, J. M. Landsberg, Hal Schenck, Jerzy Weyman:
The method of shifted partial derivatives cannot separate the permanent from the determinant. CoRR abs/1609.02103 (2016) - [i20]Christian Ikenmeyer, J. M. Landsberg:
On the complexity of the permanent in various computational models. CoRR abs/1610.00159 (2016) - [i19]Luca Chiantini, Christian Ikenmeyer, J. M. Landsberg, Giorgio Ottaviani:
The geometry of rank decompositions of matrix multiplication I: 2x2 matrices. CoRR abs/1610.08364 (2016) - 2015
- [i18]J. M. Landsberg, Mateusz Michalek:
Abelian Tensors. CoRR abs/1504.03732 (2015) - [i17]Klim Efremenko, J. M. Landsberg, Hal Schenck, Jerzy Weyman:
On minimal free resolutions and the method of shifted partial derivatives in complexity theory. CoRR abs/1504.05171 (2015) - [i16]Joseph M. Landsberg, Nicolas Ressayre:
Permanent v. determinant: an exponential lower bound assumingsymmetry and a potential path towards Valiant's conjecture. CoRR abs/1508.05788 (2015) - [i15]J. M. Landsberg:
An introduction to geometric complexity theory. CoRR abs/1509.02503 (2015) - [i14]J. M. Landsberg, Nicholas Ryder:
On the geometry of border rank algorithms for n x 2 by 2 x 2 matrix multiplication. CoRR abs/1509.08323 (2015) - 2014
- [i13]Shrawan Kumar, J. M. Landsberg:
Connections between conjectures of Alon-Tarsi, Hadamard-Howe, and integrals over the special unitary group. CoRR abs/1410.8585 (2014) - 2013
- [i12]Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg:
Computer aided methods for lower bounds on the border rank. CoRR abs/1305.0779 (2013) - [i11]J. M. Landsberg:
Geometric Complexity Theory: an introduction for geometers. CoRR abs/1305.7387 (2013) - [i10]Fulvio Gesmundo, Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg:
Complexity of linear circuits and geometry. CoRR abs/1310.1362 (2013) - 2012
- [i9]Harlan Kadish, J. M. Landsberg:
Padded polynomials, their cousins, and geometric complexity theory. CoRR abs/1204.4693 (2012) - [i8]J. M. Landsberg:
New lower bounds for the rank of matrix multiplication. CoRR abs/1206.1530 (2012) - [i7]J. M. Landsberg:
Explicit tensors of border rank at least 2n-1. CoRR abs/1209.1664 (2012) - 2011
- [i6]J. M. Landsberg, Giorgio Ottaviani:
New lower bounds for the border rank of matrix multiplication. CoRR abs/1112.6007 (2011) - 2010
- [i5]J. M. Landsberg, Laurent Manivel, Nicolas Ressayre:
Hypersurfaces with degenerate duals and the Geometric Complexity Theory Program. CoRR abs/1004.4802 (2010) - 2009
- [i4]J. M. Landsberg, Jason Morton, Serguei Norine:
Holographic algorithms without matchgates. CoRR abs/0904.0471 (2009) - [i3]Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman:
An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP. CoRR abs/0907.2850 (2009) - [i2]J. M. Landsberg:
P versus NP and geometry. CoRR abs/0910.2443 (2009) - 2007
- [i1]J. M. Landsberg:
Geometry and the complexity of matrix multiplication. CoRR abs/cs/0703059 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-03 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
