×

Found 56 Documents (Results 1–56)

An effective description of the roots of bivariates \(\bmod p^k\) and the related Igusa’s local zeta function. (English) Zbl 07760756

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). 135-144 (2023).
MSC:  68W30
PDFBibTeX XMLCite
Full Text: DOI

Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits. (English) Zbl 07711593

Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 11, 27 p. (2021).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing Igusa’s local zeta function of univariates in deterministic polynomial-time. (English) Zbl 1457.11166

Galbraith, Steven D. (ed.), ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 – July 4, 2020. Berkeley, CA: Mathematical Sciences Publishers (MSP). Open Book Ser. 4, 197-214 (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Special-case algorithms for blackbox radical membership, Nullstellensatz and transcendence degree. (English) Zbl 07300070

Mantzaflaris, Angelos (ed.), Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC ’20, Kalamata, Greece, July 20–23, 2020. New York, NY: Association for Computing Machinery (ACM). 186-193 (2020).
MSC:  68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

40th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2020, Goa, India, virtual conference, December 14–18, 2020. (English) Zbl 1451.68027

LIPIcs – Leibniz International Proceedings in Informatics 182. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-174-0). viii, 58 articles, not consecutively paged, electronic only, open access (2020).
PDFBibTeX XMLCite
Full Text: DOI Link

Counting basic-irreducible factors mod\(p^k\) in deterministic poly-time and \(p\)-adic applications. (English) Zbl 07564415

Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 15, 29 p. (2019).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficiently factoring polynomials modulo \(p^4\). (English) Zbl 1467.11113

Bradford, Russell (ed.), Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC ’19, Beijing, China, July 15–18, 2019. New York, NY: Association for Computing Machinery (ACM). 139-146 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Towards blackbox identity testing of log-variate circuits. (English) Zbl 1499.68390

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 54, 16 p. (2018).
MSC:  68W20 68Q06
PDFBibTeX XMLCite
Full Text: DOI

Algebraic dependencies and PSPACE algorithms in approximative complexity. (English) Zbl 1442.68062

Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 10, 21 p. (2018).
MSC:  68Q15 14Q20 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bootstrapping variables in algebraic circuits. (English) Zbl 1427.68356

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1166-1179 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Discovering the roots: uniform closure results for algebraic classes under factoring. (English) Zbl 1428.68398

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1152-1165 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Irreducibility and deterministic \(r\)-th root finding over finite fields. (English) Zbl 1472.11297

Burr, Michael (ed.), Proceedings of the 42nd international symposium on symbolic and algebraic computation, ISSAC 2017, Kaiserslautern, Germany, July 25–28, 2017. New York, NY: Association for Computing Machinery (ACM). 37-44 (2017).
MSC:  11T06 11Y16 68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algebraic independence over positive characteristic: new criterion and applications to locally low algebraic rank circuits. (English) Zbl 1398.68697

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 74, 15 p. (2016).
MSC:  68W30 12Y05 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Integer factoring using small algebraic dependencies. (English) Zbl 1398.11153

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 6, 14 p. (2016).
MSC:  11Y16 11Y05 11Y40
PDFBibTeX XMLCite
Full Text: DOI

Identity testing for constant-width, and commutative, read-once oblivious ABPs. (English) Zbl 1380.68224

Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 29, 16 p. (2016).
MSC:  68Q25 12Y05 68P05
PDFBibTeX XMLCite
Full Text: DOI

Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. (English) Zbl 1388.68118

Zuckerman, David (ed.), 30th conference on computational complexity, CCC’15, Portland, OR, USA, June 17–19, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-81-1). LIPIcs – Leibniz International Proceedings in Informatics 33, 323-346 (2015).
MSC:  68Q25 68Q05
PDFBibTeX XMLCite
Full Text: DOI

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

Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas. (English) Zbl 1293.94140

Proceedings of the 45th annual ACM symposium on theory of computing, STOC ’13. Palo Alto, CA, USA, June 1–4, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2029-0). 321-330 (2013).
MSC:  94C10 68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas & depth-\(3\) transcendence degree-\(k\) circuits. (English) Zbl 1286.94115

Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 599-614 (2012).
MSC:  94C10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Blackbox identity testing for bounded top fanin depth-3 circuits, the field doesn’t matter. (English) Zbl 1288.68138

Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 431-440 (2011).
MSC:  68Q25 12Y05 68W30 94C10 94C12
PDFBibTeX XMLCite
Full Text: DOI

Algebraic independence and blackbox identity testing. (English) Zbl 1333.68134

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 137-148 (2011).
MSC:  68Q25 13B25 68W20
PDFBibTeX XMLCite
Full Text: DOI arXiv

The power of depth 2 circuits over algebras. (English) Zbl 1248.68262

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, 371-382, electronic only (2009).
MSC:  68Q25 68Q05 68W30 68Q15 12Y05 68W20
PDFBibTeX XMLCite
Full Text: DOI Link

Schemes for deterministic polynomial factoring. (English) Zbl 1237.68100

May, John P. (ed.), ISSAC 2009. Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, Seoul, July 28–31, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-609-0). 191-198 (2009).
MSC:  68W30 12Y05 11T06
PDFBibTeX XMLCite
Full Text: DOI

Diagonal circuit identity testing and lower bounds. (English) Zbl 1152.68703

Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7–11, 2008. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-70574-1/pbk). Lecture Notes in Computer Science 5125, 60-71 (2008).
MSC:  68W30 68Q17 68Q25 94C10
PDFBibTeX XMLCite
Full Text: DOI Link

Equivalence of \(\mathbb{F}\)-algebras and cubic forms. (English) Zbl 1137.68064

Durand, Bruno (ed.) et al., STACS 2006. 23rd annual symposium on theoretical aspects of computer science, Marseille, France, February 23–25, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-32301-3/pbk). Lecture Notes in Computer Science 3884, 115-126 (2006).
PDFBibTeX XMLCite
Full Text: DOI

Automorphisms of finite rings and applications to complexity of problems. (English) Zbl 1119.68093

Diekert, Volker (ed.) et al., STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24–26, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24998-2/pbk). Lecture Notes in Computer Science 3404, 1-17 (2005).
MSC:  68Q25 11Y16
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field