×

Found 331 Documents (Results 1–100)

Elimination ideal and bivariate resultant over finite fields. (English) Zbl 07760799

Dickenstein, Alicia (ed.) et al., Proceedings of the 48th international symposium on symbolic and algebraic computation, ISSAC, Tromsø, Norway, July 24–27, 2023. New York, NY: Association for Computing Machinery (ACM). 526-534 (2023).
MSC:  68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv HAL

Flip graphs for matrix multiplication. (English) Zbl 07760783

Dickenstein, Alicia (ed.) et al., Proceedings of the 48th international symposium on symbolic and algebraic computation, ISSAC, Tromsø, Norway, July 24–27, 2023. New York, NY: Association for Computing Machinery (ACM). 381-388 (2023).
MSC:  68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Chudnovsky-type algorithms over the projective line using generalized evaluation maps. (English) Zbl 1522.94035

El Hajji, Said (ed.) et al., Codes, cryptology and information security. 4th international conference, C2SI 2023, Rabat, Morocco, May 29–31, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13874, 360-375 (2023).
PDFBibTeX XMLCite
Full Text: DOI

Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity. (English) Zbl 1529.11128

Mesnager, Sihem (ed.) et al., Arithmetic of finite fields. 9th international workshop, WAIFI 2022, Chengdu, China, August 29 – September 2, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13638, 35-52 (2023).
MSC:  11Y16 11T30 12-08
PDFBibTeX XMLCite
Full Text: DOI

A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line. (English) Zbl 1506.11152

Anni, Samuele (ed.) et al., Arithmetic, geometry, cryptography, and coding theory, AGC2T. 18th international conference, Centre International de Rencontres Mathématiques, Marseille, France, May 31 – June 4, 2021. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 779, 13-32 (2022).
MSC:  11T71 11Y16
PDFBibTeX XMLCite
Full Text: DOI HAL

The quadratic hull of a code and the geometric view on multiplication algorithms. (English) Zbl 1497.94178

Ballet, Stéphane (ed.) et al., Arithmetic, geometry, cryptography and coding theory, AGC2T, 17th international conference, Centre International de Rencontres Mathématiques, Marseilles, France, June 10–14, 2019. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 770, 267-296 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry. (English. Russian original) Zbl 1482.11164

Russ. Math. Surv. 76, No. 1, 29-89 (2021); translation from Usp. Mat. Nauk 76, No. 1, 31-94 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algebraic hardness versus randomness in low characteristic. (English) Zbl 07561765

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 37, 32 p. (2020).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Geometric rank of tensors and subrank of matrix multiplication. (English) Zbl 07561763

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 35, 21 p. (2020).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

A super-quadratic lower bound for depth four arithmetic circuits. (English) Zbl 07561751

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 23, 31 p. (2020).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI

Lower bounds for matrix factorization. (English) Zbl 07561733

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 5, 20 p. (2020).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI

On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions. (English) Zbl 07561544

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 51, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Barriers for rank methods in arithmetic complexity. (English) Zbl 1462.68069

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 1, 19 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software