×

Found 52 Documents (Results 1–52)

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI

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).
MSC:  13P15 65D99
PDFBibTeX XMLCite
Full Text: Link

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
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI Link

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).
PDFBibTeX XMLCite

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).
PDFBibTeX XMLCite

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).
PDFBibTeX XMLCite

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).
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field