{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:39:12Z","timestamp":1776764352461,"version":"3.51.2"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00224-025-10253-8","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:04:51Z","timestamp":1772715891000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree 2 Lower Bound for Permanent in Arbitrary Characteristic"],"prefix":"10.1007","volume":"70","author":[{"given":"Harpreet","family":"Bedi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Suagee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,5]]},"reference":[{"issue":"1","key":"10253_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0890-5401(90)90036-H","volume":"84","author":"J-Y Cai","year":"1990","unstructured":"Cai, J.-Y.: A note on the determinant and permanent problem. Inf. Comput. 84(1), 119\u2013127 (1990)","journal-title":"Inf. Comput."},{"issue":"79","key":"10253_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00037-009-0284-2","volume":"19","author":"J-Y Cai","year":"2010","unstructured":"Cai, J.-Y., Chen, X., Li, D.: Quadratic lower bound for permanent vs. determinant in any characteristic. Comput. Complex. 19(79), 37\u201356 (2010)","journal-title":"Comput. Complex."},{"key":"10253_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0024-3795(87)90337-5","volume":"96","author":"J Gathen","year":"1987","unstructured":"Gathen, J.: Permanent and determinant. Linear Algebra Appl. 96, 87\u2013100 (1987)","journal-title":"Linear Algebra Appl."},{"key":"10253_CR4","doi-asserted-by":"crossref","unstructured":"Landsberg. J.M.: Geometry and Complexity Theory. Cambridge Studies in Advanced Mathematics. Cambridge University Press (2017)","DOI":"10.1017\/9781108183192"},{"key":"10253_CR5","doi-asserted-by":"crossref","unstructured":"Landsberg, J.M., Ressayre, N.: Permanent v. determinant: An exponential lower bound assuming symmetry and a potential path towards Valiant\u2019s conjecture. Differ. Geom. Appl. 55, 146\u2013166 (2017). Geometry and complexity theory","DOI":"10.1016\/j.difgeo.2017.03.017"},{"issue":"79","key":"10253_CR6","doi-asserted-by":"publisher","first-page":"4241","DOI":"10.1155\/S1073792804142566","volume":"2004","author":"T Mignon","year":"2004","unstructured":"Mignon, T., Ressayre, N.: A quadratic bound for the determinant and permanent problem. Int. Math. Res. Not. 2004(79), 4241\u20134253 (2004)","journal-title":"Int. Math. Res. Not."},{"key":"10253_CR7","doi-asserted-by":"crossref","unstructured":"Minc, H., Marcus, M.: Permanents. Encyclopedia of Mathematics and its Applications. Cambridge University Press (1984)","DOI":"10.1017\/CBO9781107340688"},{"key":"10253_CR8","unstructured":"Suagee, J.: Hessian is full rank. (2022). https:\/\/github.com\/jsuagee\/hessian_of_permanent_is_full_rank_demonstration. Accessed 19 Oct 2022"},{"key":"10253_CR9","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Completeness classes in algebra. Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)","DOI":"10.1145\/800135.804419"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10253-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-025-10253-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10253-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:42:25Z","timestamp":1776760945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-025-10253-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10253"],"URL":"https:\/\/doi.org\/10.1007\/s00224-025-10253-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"20 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"13"}}