Basu, Saugata (ed.); Kummer, Mario (ed.); Netzer, Tim (ed.); Vinzant, Cynthia (ed.) New directions in real algebraic geometry. Abstracts from the workshop held March 19–24, 2023. (English) Zbl 1525.00012 Oberwolfach Rep. 20, No. 1, 813-881 (2023). MSC: 00B05 00B25 14-06 13J30 14Pxx 52A41 05B35 68W25 81R15 PDFBibTeX XMLCite \textit{S. Basu} (ed.) et al., Oberwolfach Rep. 20, No. 1, 813--881 (2023; Zbl 1525.00012) Full Text: DOI
Kaminski, Michael; Shparlinski, Igor E.; Waldschmidt, Michel On sets of linear forms of maximal complexity. (English) Zbl 07638239 Comput. Complexity 32, No. 1, Paper No. 1, 26 p. (2023). MSC: 68Q17 11C08 13F20 PDFBibTeX XMLCite \textit{M. Kaminski} et al., Comput. Complexity 32, No. 1, Paper No. 1, 26 p. (2023; Zbl 07638239) Full Text: DOI arXiv
de Boor, Carl (ed.); Sauer, Tomas (ed.); Schenck, Henry (ed.); Sorokina, Tatyana (ed.) Mini-workshop: Interpolation, approximation, and algebra. Abstracts from the mini-workshop held February 13–19, 2022. (English) Zbl 1506.00060 Oberwolfach Rep. 19, No. 1, 383-428 (2022). MSC: 00B05 00B25 65-06 13-06 13P25 14Q65 65Dxx 65H14 PDFBibTeX XMLCite \textit{C. de Boor} (ed.) et al., Oberwolfach Rep. 19, No. 1, 383--428 (2022; Zbl 1506.00060) Full Text: DOI
Lichtblau, Daniel Approximate polynomial GCD by approximate syzygies. (English) Zbl 1474.13053 Math. Comput. Sci. 13, No. 4, 517-532 (2019). MSC: 13P05 13P10 68W30 68W25 PDFBibTeX XMLCite \textit{D. Lichtblau}, Math. Comput. Sci. 13, No. 4, 517--532 (2019; Zbl 1474.13053) Full Text: DOI
Harvey, David; van der Hoeven, Joris Faster polynomial multiplication over finite fields using cyclotomic coefficient rings. (English) Zbl 1423.12010 J. Complexity 54, Article ID 101404, 18 p. (2019). Reviewer: Mihai Cipu (Bucureşti) MSC: 12Y05 68W30 65Y20 11C08 65T60 11T06 13M10 13F20 68Q17 68W40 PDFBibTeX XMLCite \textit{D. Harvey} and \textit{J. van der Hoeven}, J. Complexity 54, Article ID 101404, 18 p. (2019; Zbl 1423.12010) Full Text: DOI HAL
Kolev, Vasil; Cooklev, Todor; Keinert, Fritz Design of a Simple Orthogonal Multiwavelet Filter by Matrix Spectral Factorization. arXiv:1910.07133 Preprint, arXiv:1910.07133 [cs.CV] (2019). MSC: 47Axx 42Cxx 65Txx 65Dxx 11Cxx 12Yxx 13P15 15Bxx 94Axx 97H60 97R20 BibTeX Cite \textit{V. Kolev} et al., ``Design of a Simple Orthogonal Multiwavelet Filter by Matrix Spectral Factorization'', Preprint, arXiv:1910.07133 [cs.CV] (2019) Full Text: DOI arXiv OA License
Williams, R. Ryan Counting solutions to polynomial systems via reductions. (English) Zbl 1433.68161 Seidel, Raimund (ed.), 1st symposium on simplicity in algorithms. SOSA 2018, January 7–10, 2018, New Orleans, LA, USA. Co-located with the 29th ACM-SIAM symposium on discrete algorithms (SODA 2018). Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 61, Article 6, 15 p. (2018). MSC: 68Q17 11T06 13P15 68Q25 68W20 PDFBibTeX XMLCite \textit{R. R. Williams}, OASIcs -- OpenAccess Ser. Inform. 61, Article 6, 15 p. (2018; Zbl 1433.68161) Full Text: DOI
Abbott, John; Bigatti, Anna Maria Gröbner bases for everyone with CoCoA-5 and CoCoALib. (English) Zbl 1411.13001 Hibi, Takayuki (ed.), The 50th anniversary of Gröbner bases. Proceedings of the 8th Mathematical Society of Japan-Seasonal Institute (MSJ-SI 2015), Osaka, Japan, July 1–10, 2015. Tokyo: Mathematical Society of Japan (MSJ). Adv. Stud. Pure Math. 77, 1-24 (2018). MSC: 13-04 13P10 68W30 13P15 14Q10 05E40 68W25 PDFBibTeX XMLCite \textit{J. Abbott} and \textit{A. M. Bigatti}, Adv. Stud. Pure Math. 77, 1--24 (2018; Zbl 1411.13001) Full Text: arXiv
Khalid, Asma; Popescu, Adrian; Popescu, Dorin Algorithms in the classical Néron desingularization. (English) Zbl 1399.13009 Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér. 61(109), No. 1, 83-94 (2018). MSC: 13B40 14B25 13H05 13J15 PDFBibTeX XMLCite \textit{A. Khalid} et al., Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér. 61(109), No. 1, 83--94 (2018; Zbl 1399.13009) Full Text: arXiv
Mahajan, Meena; Saurabh, Nitin Some complete and intermediate polynomials in algebraic complexity theory. (English) Zbl 1393.68079 Theory Comput. Syst. 62, No. 3, 622-652 (2018). MSC: 68Q25 13P25 68Q15 68Q17 PDFBibTeX XMLCite \textit{M. Mahajan} and \textit{N. Saurabh}, Theory Comput. Syst. 62, No. 3, 622--652 (2018; Zbl 1393.68079) Full Text: DOI arXiv
Belovs, Aleksandrs; Ivanyos, Gábor; Qiao, Youming; Santha, Miklos; Yang, Siyi On the polynomial parity argument complexity of the combinatorial Nullstellensatz. (English) Zbl 1440.68101 O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 30, 24 p. (2017). MSC: 68Q17 05D99 13P15 13P25 68Q06 68Q25 PDFBibTeX XMLCite \textit{A. Belovs} et al., LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 30, 24 p. (2017; Zbl 1440.68101) Full Text: DOI arXiv
Merrien, Jean-Louis; Sauer, Tomas Extended Hermite subdivision schemes. (English) Zbl 1357.41030 J. Comput. Appl. Math. 317, 343-361 (2017). MSC: 41A60 65D15 13P05 PDFBibTeX XMLCite \textit{J.-L. Merrien} and \textit{T. Sauer}, J. Comput. Appl. Math. 317, 343--361 (2017; Zbl 1357.41030) Full Text: DOI HAL
Brand, Cornelius; Sagraloff, Michael On the complexity of solving zero-dimensional polynomial systems via projection. (English) Zbl 1362.13032 Rosenkranz, Markus (ed.), Proceedings of the 41st international symposium on symbolic and algebraic computation, ISSAC 2016, Waterloo, Canada, July 20–22, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4380-0). 151-158 (2016). MSC: 13P15 68Q17 68W20 PDFBibTeX XMLCite \textit{C. Brand} and \textit{M. Sagraloff}, in: Proceedings of the 41st international symposium on symbolic and algebraic computation, ISSAC 2016, Waterloo, Canada, July 20--22, 2016. New York, NY: Association for Computing Machinery (ACM). 151--158 (2016; Zbl 1362.13032) Full Text: DOI arXiv
Mahajan, Meena; Saurabh, Nitin Some complete and intermediate polynomials in algebraic complexity theory. (English) Zbl 1385.68018 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-34170-5/pbk; 978-3-319-34171-2/ebook). Lecture Notes in Computer Science 9691, 251-265 (2016). MSC: 68Q25 13P25 68Q15 68Q17 PDFBibTeX XMLCite \textit{M. Mahajan} and \textit{N. Saurabh}, Lect. Notes Comput. Sci. 9691, 251--265 (2016; Zbl 1385.68018) Full Text: DOI arXiv
De Loera, Jesús A.; Margulies, Susan; Pernpeintner, Michael; Riedl, Eric; Rolnick, David; Spencer, Gwen; Stasi, Despina; Swenson, Jon Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases. (English) Zbl 1345.68154 Proceedings of the 40th international symposium on symbolic and algebraic computation, ISSAC 2015, Bath, UK, July 6–9, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3435-8). 133-140 (2015). MSC: 68Q17 05C15 05C85 13P10 PDFBibTeX XMLCite \textit{J. A. De Loera} et al., in: Proceedings of the 40th international symposium on symbolic and algebraic computation, ISSAC 2015, Bath, UK, July 6--9, 2015. New York, NY: Association for Computing Machinery (ACM). 133--140 (2015; Zbl 1345.68154) Full Text: DOI
Berkholz, Christoph; Grohe, Martin Limitations of algebraic approaches to graph isomorphism testing. (English) Zbl 1410.68152 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 155-166 (2015). MSC: 68Q25 05C25 05C60 13P10 68Q17 68W30 PDFBibTeX XMLCite \textit{C. Berkholz} and \textit{M. Grohe}, Lect. Notes Comput. Sci. 9134, 155--166 (2015; Zbl 1410.68152) Full Text: DOI arXiv
Horváth, Gábor The complexity of the equivalence and equation solvability problems over meta-abelian groups. (English) Zbl 1364.20016 J. Algebra 433, 208-230 (2015). Reviewer: Anton A. Klyachko (Moskva) MSC: 20F10 13M10 20F70 68Q17 20E22 20E06 PDFBibTeX XMLCite \textit{G. Horváth}, J. Algebra 433, 208--230 (2015; Zbl 1364.20016) Full Text: DOI
Saxena, Nitin Progress on polynomial identity testing. II. (English) Zbl 1345.68182 Agrawal, Manindra (ed.) et al., Perspectives in computational complexity. The Somenath Biswas anniversary volume. Selected papers based on the presentations at the workshop, Kanpur, India, Summer 2012. Cham: Birkhäuser/Springer (ISBN 978-3-319-05445-2/hbk; 978-3-319-05446-9/ebook). Progress in Computer Science and Applied Logic 26, 131-146 (2014). MSC: 68Q25 12Y05 13P05 68Q05 68Q17 68W30 68-02 PDFBibTeX XMLCite \textit{N. Saxena}, Prog. Comput. Sci. Appl. Log. 26, 131--146 (2014; Zbl 1345.68182) Full Text: DOI
Kumar, Abhinav; Lokam, Satyanarayana V.; Patankar, Vijay M.; Sarma, M. N. Jayalal Using elimination theory to construct rigid matrices. (English) Zbl 1366.68076 Comput. Complexity 23, No. 4, 531-563 (2014). MSC: 68Q17 13P10 14Q10 15A03 15A15 68Q25 68W30 PDFBibTeX XMLCite \textit{A. Kumar} et al., Comput. Complexity 23, No. 4, 531--563 (2014; Zbl 1366.68076) Full Text: DOI arXiv Link
Xiao, Shuijing; Zeng, Xiaoning; Zeng, Guangxing An improved algorithm for deciding semi-definite polynomials. (English) Zbl 1312.13035 J. Algebra 417, 72-94 (2014). MSC: 13P99 65D99 13J30 PDFBibTeX XMLCite \textit{S. Xiao} et al., J. Algebra 417, 72--94 (2014; Zbl 1312.13035) Full Text: DOI
Grigoriev, Dima; Muzychuk, Mikhail; Ponomarenko, Ilya Tensor rank: matching polynomials and Schur rings. (English) Zbl 1305.15060 Found. Comput. Math. 14, No. 3, 457-481 (2014). Reviewer: Jaydeb Sarkar (Bangalore) MSC: 15A69 13A50 14Q20 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Grigoriev} et al., Found. Comput. Math. 14, No. 3, 457--481 (2014; Zbl 1305.15060) Full Text: DOI HAL
Landsberg, J. M. New lower bounds for the rank of matrix multiplication. (English) Zbl 1298.68100 SIAM J. Comput. 43, No. 1, 144-149 (2014). MSC: 68Q17 68Q25 14Q20 13P99 PDFBibTeX XMLCite \textit{J. M. Landsberg}, SIAM J. Comput. 43, No. 1, 144--149 (2014; Zbl 1298.68100) Full Text: DOI arXiv
Massarenti, Alex; Raviolo, Emanuele Corrigendum to “The rank of \(n{\times}n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)”. (English) Zbl 1284.68302 Linear Algebra Appl. 445, 369-371 (2014). MSC: 68Q25 68Q17 14Q20 13P99 68W30 PDFBibTeX XMLCite \textit{A. Massarenti} and \textit{E. Raviolo}, Linear Algebra Appl. 445, 369--371 (2014; Zbl 1284.68302) Full Text: DOI
Eliaš, Ján; Zítko, Jan Approximate polynomial GCD. (English) Zbl 1340.13017 Chleboun, J. (ed.) et al., Programs and algorithms of numerical mathematics 16. Proceedings of the 16th seminar (PANM), Dolní Maxov, Czech Republic, June 3–8, 2012. Prague: Academy of Sciences of the Czech Republic, Institute of Mathematics (ISBN 978-80-85823-62-2). 63-68 (2013). Reviewer: Karel Segeth (Praha) MSC: 13P15 65D99 PDFBibTeX XMLCite \textit{J. Eliaš} and \textit{J. Zítko}, in: Programs and algorithms of numerical mathematics 16. Proceedings of the 16th seminar (PANM), Dolní Maxov, Czech Republic, June 3--8, 2012. Prague: Academy of Sciences of the Czech Republic, Institute of Mathematics. 63--68 (2013; Zbl 1340.13017) Full Text: Link
Nagasaka, Kosaku; Masui, Takaaki Extended QRGCD algorithm. (English) Zbl 1412.13031 Gerdt, Vladimir P. (ed.) et al., Computer algebra in scientific computing. 15th international workshop, CASC 2013, Berlin, Germany, September 9–13, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8136, 257-272 (2013). MSC: 13P15 65D99 68W30 PDFBibTeX XMLCite \textit{K. Nagasaka} and \textit{T. Masui}, Lect. Notes Comput. Sci. 8136, 257--272 (2013; Zbl 1412.13031) Full Text: DOI
Massarenti, Alex; Raviolo, Emanuele The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\). (English) Zbl 1284.68301 Linear Algebra Appl. 438, No. 11, 4500-4509 (2013); corrigendum ibid. 445, 369-371 (2014). MSC: 68Q25 68Q17 14Q20 13P99 68W30 PDFBibTeX XMLCite \textit{A. Massarenti} and \textit{E. Raviolo}, Linear Algebra Appl. 438, No. 11, 4500--4509 (2013; Zbl 1284.68301) Full Text: DOI arXiv
Fassino, Claudia; Torrente, Maria-Laura Simple varieties for limited precision points. (English) Zbl 1291.65081 Theor. Comput. Sci. 479, 174-186 (2013). MSC: 65D99 68W30 13P15 26C10 PDFBibTeX XMLCite \textit{C. Fassino} and \textit{M.-L. Torrente}, Theor. Comput. Sci. 479, 174--186 (2013; Zbl 1291.65081) Full Text: DOI arXiv
Batselier, Kim; Dreesen, Philippe; de Moor, Bart The geometry of multivariate polynomial division and elimination. (English) Zbl 1269.65026 SIAM J. Matrix Anal. Appl. 34, No. 1, 102-125 (2013). MSC: 65D99 13P05 13P10 65F15 65F30 PDFBibTeX XMLCite \textit{K. Batselier} et al., SIAM J. Matrix Anal. Appl. 34, No. 1, 102--125 (2013; Zbl 1269.65026) Full Text: DOI Link
Van Der Hoeven, Joris; Lecerf, Grégoire On the bit-complexity of sparse polynomial and series multiplication. (English) Zbl 1261.65017 J. Symb. Comput. 50, 227-254 (2013). Reviewer: Adhemar Bultheel (Leuven) MSC: 65D15 13P05 65Y20 PDFBibTeX XMLCite \textit{J. Van Der Hoeven} and \textit{G. Lecerf}, J. Symb. Comput. 50, 227--254 (2013; Zbl 1261.65017) Full Text: DOI
Merrien, Jean-Louis; Sauer, Tomas From Hermite to stationary subdivision schemes in one and several variables. (English) Zbl 1251.41014 Adv. Comput. Math. 36, No. 4, 547-579 (2012). MSC: 41A60 65D15 13P05 PDFBibTeX XMLCite \textit{J.-L. Merrien} and \textit{T. Sauer}, Adv. Comput. Math. 36, No. 4, 547--579 (2012; Zbl 1251.41014) Full Text: DOI
Corless, Robert M.; Postma, Erik; Stoutemyer, David R. GCD of multivariate approximate polynomials using beautification with the subtractive algorithm. (English) Zbl 1346.68279 Moreno Maza, Marc (ed.), Proceedings of the 2011 international workshop on symbolic-numeric computation, SNC 2011, San Jose, CA, USA, June 7–11, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0515-0). 153-154 (2011). MSC: 68W30 12D05 12Y05 13P05 65D99 PDFBibTeX XMLCite \textit{R. M. Corless} et al., in: Proceedings of the 2011 international workshop on symbolic-numeric computation, SNC 2011, San Jose, CA, USA, June 7--11, 2011. New York, NY: Association for Computing Machinery (ACM). 153--154 (2011; Zbl 1346.68279) Full Text: DOI
Boito, Paola; Ruatta, Olivier Extended companion matrix for approximate GCD. (English) Zbl 1346.68270 Moreno Maza, Marc (ed.), Proceedings of the 2011 international workshop on symbolic-numeric computation, SNC 2011, San Jose, CA, USA, June 7–11, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0515-0). 74-80 (2011). MSC: 68W30 12D05 12Y05 13P05 65D99 PDFBibTeX XMLCite \textit{P. Boito} and \textit{O. Ruatta}, in: Proceedings of the 2011 international workshop on symbolic-numeric computation, SNC 2011, San Jose, CA, USA, June 7--11, 2011. New York, NY: Association for Computing Machinery (ACM). 74--80 (2011; Zbl 1346.68270) Full Text: DOI
Ananth, Prabhanjan Vijendra; Dukkipati, Ambedkar Border basis detection is NP-complete. (English) Zbl 1323.68310 Leykin, Anton (ed.), Proceedings of the 36th international symposium on symbolic and algebraic computation, ISSAC 2011, San Jose, CA, USA, June 7–11, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0675-1). 11-18 (2011). MSC: 68Q25 13P10 68Q17 68W30 PDFBibTeX XMLCite \textit{P. V. Ananth} and \textit{A. Dukkipati}, in: Proceedings of the 36th international symposium on symbolic and algebraic computation, ISSAC 2011, San Jose, CA, USA, June 7--11, 2011. New York, NY: Association for Computing Machinery (ACM). 11--18 (2011; Zbl 1323.68310) Full Text: DOI arXiv
Leykin, Anton Numerical algebraic geometry. (English) Zbl 1311.14057 J. Softw. Algebra Geom. 3, 5-10 (2011). MSC: 14Q99 68N01 13P15 65D99 65Y15 68W30 PDFBibTeX XMLCite \textit{A. Leykin}, J. Softw. Algebra Geom. 3, 5--10 (2011; Zbl 1311.14057) Full Text: DOI
Merrien, Jean-Louis; Sauer, Tomas A generalized Taylor factorization for Hermite subdivision schemes. (English) Zbl 1231.41036 J. Comput. Appl. Math. 236, No. 4, 565-574 (2011). MSC: 41A60 65D15 13P05 PDFBibTeX XMLCite \textit{J.-L. Merrien} and \textit{T. Sauer}, J. Comput. Appl. Math. 236, No. 4, 565--574 (2011; Zbl 1231.41036) Full Text: DOI
Khashan, Hani; Syam, Muhammed I. QR-algebraic method for approximating zeros of system of polynomials. (English) Zbl 1211.65058 Int. J. Comput. Math. 88, No. 1, 110-120 (2011). MSC: 65H10 65H04 12D10 13P10 26C10 65F30 74G15 97N30 PDFBibTeX XMLCite \textit{H. Khashan} and \textit{M. I. Syam}, Int. J. Comput. Math. 88, No. 1, 110--120 (2011; Zbl 1211.65058) Full Text: DOI
Chen, Xi; Kayal, Neeraj; Wigderson, Avi Partial derivatives in arithmetic complexity and beyond. (English) Zbl 1278.68010 Found. Trends Theor. Comput. Sci. 6, No. 1-2, 1-138 (2010). MSC: 68-02 12D10 13P05 68Q17 68Q25 68W30 PDFBibTeX XMLCite \textit{X. Chen} et al., Found. Trends Theor. Comput. Sci. 6, No. 1--2, 1--138 (2010; Zbl 1278.68010) Full Text: DOI Backlinks: MO
Kumar, Abhinav; Lokam, Satyanarayana V.; Patankar, Vijay M.; Sarma M. N., Jayalal Using elimination theory to construct rigid matrices. (English) Zbl 1248.68221 Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15–17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPIcs – Leibniz International Proceedings in Informatics 4, 299-310, electronic only (2009). MSC: 68Q17 13P10 14Q10 15A03 15A15 68Q25 68W30 PDFBibTeX XMLCite \textit{A. Kumar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 4, 299--310 (2009; Zbl 1248.68221) Full Text: DOI Link
Zeng, Zhonggang The closedness subspace method for computing the multiplicity structure of a polynomial system. (English) Zbl 1181.65074 Bates, Daniel J. (ed.) et al., Interactions of classical and numerical algebraic geometry. A conference in honor of Andrew Sommese, Notre Dame, IN, USA, May 22–24, 2008. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4746-6/pbk). Contemporary Mathematics 496, 347-362 (2009). MSC: 65H10 68W25 68W30 14Q99 74G35 13P10 PDFBibTeX XMLCite \textit{Z. Zeng}, Contemp. Math. 496, 347--362 (2009; Zbl 1181.65074)
Lang, Feng-Gong; Wang, Ren-Hong Intersection points algorithm for piecewise algebraic curves based on Groebner bases. (English) Zbl 1176.65019 J. Appl. Math. Comput. 29, No. 1-2, 357-366 (2009). MSC: 65D18 65D07 14Q05 68W25 13P10 65G30 PDFBibTeX XMLCite \textit{F.-G. Lang} and \textit{R.-H. Wang}, J. Appl. Math. Comput. 29, No. 1--2, 357--366 (2009; Zbl 1176.65019) Full Text: DOI
Viazminsky, C. P. Necessary and sufficient conditions for a function to be separable. (English) Zbl 1157.65014 Appl. Math. Comput. 204, No. 2, 658-670 (2008). MSC: 65D15 12Y05 13P05 PDFBibTeX XMLCite \textit{C. P. Viazminsky}, Appl. Math. Comput. 204, No. 2, 658--670 (2008; Zbl 1157.65014) Full Text: DOI
Peña, Juan Manuel; Sauer, Tomas Efficient polynomial reduction. (English) Zbl 1109.13024 Adv. Comput. Math. 26, No. 1-3, 323-336 (2007). MSC: 13P10 42C05 41A10 65D15 PDFBibTeX XMLCite \textit{J. M. Peña} and \textit{T. Sauer}, Adv. Comput. Math. 26, No. 1--3, 323--336 (2007; Zbl 1109.13024) Full Text: DOI
Chtcherba, Arthur D.; Kapur, Deepak Support hull: relating the Cayley-Dixon resultant constructions to the support of a polynomial system. (English) Zbl 1134.13310 Gutierrez, Jaime (ed.), ISSAC 2004. Proceedings of the 2004 international symposium on symbolic and algebraic computation, Santander, Spain, July 4–7, 2004. New York, NY: ACM Press (ISBN 1-58113-827-X/pbk). 95-102 (2004). MSC: 13P99 68Q17 68Q25 65H99 PDFBibTeX XMLCite \textit{A. D. Chtcherba} and \textit{D. Kapur}, in: Proceedings of the 2004 international symposium on symbolic and algebraic computation, ISSAC 2004, Santander, Spain, July 4--7, 2004. New York, NY: ACM Press. 95--102 (2004; Zbl 1134.13310)
Mayr, Ernst W. It is on the boundary: Complexity considerations for polynomial ideals. (English) Zbl 0998.68661 van Leeuwen, Jan (ed.) et al., Theoretical computer science. Exploring new frontiers of theoretical informatics. International conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1872, 99 (2000). MSC: 68U99 68Q25 68Q17 13P10 68W30 PDFBibTeX XMLCite \textit{E. W. Mayr}, Lect. Notes Comput. Sci. 1872, 99 (2000; Zbl 0998.68661)
Grigoriev, Dima Yu.; Lakshman, Y. N. Algorithms for computing sparse shifts for multivariate polynomials. (English) Zbl 0968.68199 Appl. Algebra Eng. Commun. Comput. 11, No. 1, 43-67 (2000). Reviewer: Vilmar Trevisan (Porto Alegre) MSC: 68W30 13P10 68W25 68W40 PDFBibTeX XMLCite \textit{D. Yu. Grigoriev} and \textit{Y. N. Lakshman}, Appl. Algebra Eng. Commun. Comput. 11, No. 1, 43--67 (2000; Zbl 0968.68199) Full Text: DOI HAL
Gonzalez-Vega, Laureano; Rouillier, Fabrice; Roy, Marie-Françoise Symbolic recipes for polynomial system solving. (English) Zbl 0966.13020 Cohen, Arjeh M. (ed.) et al., Some tapas of computer algebra. Berlin: Springer. Algorithms Comput. Math. 4, 34-65 (1999). Reviewer: Emanuela De Negri (Genova) MSC: 13P10 12Y05 65H10 12E05 11Y16 PDFBibTeX XMLCite \textit{L. Gonzalez-Vega} et al., Algorithms Comput. Math. 4, 34--65 (1999; Zbl 0966.13020)
Nauheim, Raphael Systems of algebraic equations with bad reduction. (English) Zbl 0921.12002 J. Symb. Comput. 25, No. 5, 619-641 (1998). Reviewer: Juan Sabia (Buenos Aires) MSC: 12Y05 12E12 13P10 68W30 65H10 PDFBibTeX XMLCite \textit{R. Nauheim}, J. Symb. Comput. 25, No. 5, 619--641 (1998; Zbl 0921.12002) Full Text: DOI
Gutierrez, Jaime; Recio, Tomas Advances on the simplification of sine-cosine equations. (English) Zbl 0912.65041 J. Symb. Comput. 26, No. 1, 31-70 (1998). Reviewer: G.Steidl (Mannheim) MSC: 65H10 70B15 65T40 13P10 70B10 70E15 PDFBibTeX XMLCite \textit{J. Gutierrez} and \textit{T. Recio}, J. Symb. Comput. 26, No. 1, 31--70 (1998; Zbl 0912.65041) Full Text: DOI
Krick, T.; Pardo, L. M. A computational method for diophantine approximation. (English) Zbl 0878.11043 González-Vega, Laureano (ed.) et al., Algorithms in algebraic geometry and applications. Proceedings of the MEGA-94 conference, Santander, Spain, April 5-9, 1994. Basel: Birkhäuser. Prog. Math. 143, 193-253 (1996). Reviewer: J.R.Sendra (Madrid) MSC: 11Y16 11J99 68W30 68Q25 13P10 14A05 PDFBibTeX XMLCite \textit{T. Krick} and \textit{L. M. Pardo}, Prog. Math. 143, 193--253 (1996; Zbl 0878.11043)
Takayama, Nobuki An approach to the zero recognition problem by Buchberger algorithm. (English) Zbl 0763.65007 J. Symb. Comput. 14, No. 2-3, 265-282 (1992). Reviewer: S.Ogawa (Hyogo) MSC: 65D15 68W30 13P10 12Y05 PDFBibTeX XMLCite \textit{N. Takayama}, J. Symb. Comput. 14, No. 2--3, 265--282 (1992; Zbl 0763.65007) Full Text: DOI
Dorn, William S.; McCracken, Daniel D. Numerical methods with FORTRAN IV case studies. (Reprint of the orig. ed. publ. 1972 by John Wiley & Sons, Inc., New York). (English) Zbl 0649.65003 Melbourne, Florida: Krieger Publishing Co., Inc. 462 p.; $ 45.00 (1987). MSC: 65-01 68-01 65Hxx 65G50 65Fxx 65Dxx 65Lxx 15-04 13-04 34-04 PDFBibTeX XML
Tolimieri, R. Multiplicative characters and the discrete Fourier transform. (English) Zbl 0614.65147 Adv. Appl. Math. 7, 344-380 (1986). Reviewer: A.Varga MSC: 65T40 65F30 42A15 13H15 20G25 11T22 11E08 PDFBibTeX XMLCite \textit{R. Tolimieri}, Adv. Appl. Math. 7, 344--380 (1986; Zbl 0614.65147) Full Text: DOI