Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Zeyu Guo. Variety Evasive Subspace Families. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 20:1-20:33, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{guo:LIPIcs.CCC.2021.20, author = {Guo, Zeyu}, title = {{Variety Evasive Subspace Families}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {20:1--20:33}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.20}, URN = {urn:nbn:de:0030-drops-142949}, doi = {10.4230/LIPIcs.CCC.2021.20}, annote = {Keywords: algebraic complexity, dimension reduction, Noether normalization, polynomial identity testing, pseudorandomness, varieties} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Zeyu Guo. Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 42:1-42:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{guo:LIPIcs.MFCS.2020.42, author = {Guo, Zeyu}, title = {{Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.42}, URN = {urn:nbn:de:0030-drops-127082}, doi = {10.4230/LIPIcs.MFCS.2020.42}, annote = {Keywords: polynomial factoring, permutation group, finite field, algebraic combinatorics, additive combinatorics, derandomization} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Zeyu Guo and Rohit Gurjar. Improved Explicit Hitting-Sets for ROABPs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 4:1-4:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{guo_et_al:LIPIcs.APPROX/RANDOM.2020.4, author = {Guo, Zeyu and Gurjar, Rohit}, title = {{Improved Explicit Hitting-Sets for ROABPs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.4}, URN = {urn:nbn:de:0030-drops-126076}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.4}, annote = {Keywords: polynomial identity testing, hitting-set, ROABP, arithmetic branching programs, derandomization} }
Published in: LIPIcs, Volume 169, 35th Computational Complexity Conference (CCC 2020)
Amit Sinhababu and Thomas Thierauf. Factorization of Polynomials Given By Arithmetic Branching Programs. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 33:1-33:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{sinhababu_et_al:LIPIcs.CCC.2020.33, author = {Sinhababu, Amit and Thierauf, Thomas}, title = {{Factorization of Polynomials Given By Arithmetic Branching Programs}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {33:1--33:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.33}, URN = {urn:nbn:de:0030-drops-125854}, doi = {10.4230/LIPIcs.CCC.2020.33}, annote = {Keywords: Arithmetic Branching Program, Multivariate Polynomial Factorization, Hensel Lifting, Newton Iteration, Hardness vs Randomness} }
Published in: LIPIcs, Volume 102, 33rd Computational Complexity Conference (CCC 2018)
Zeyu Guo, Nitin Saxena, and Amit Sinhababu. Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity. In 33rd Computational Complexity Conference (CCC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 102, pp. 10:1-10:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{guo_et_al:LIPIcs.CCC.2018.10, author = {Guo, Zeyu and Saxena, Nitin and Sinhababu, Amit}, title = {{Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity}}, booktitle = {33rd Computational Complexity Conference (CCC 2018)}, pages = {10:1--10:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-069-9}, ISSN = {1868-8969}, year = {2018}, volume = {102}, editor = {Servedio, Rocco A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.10}, URN = {urn:nbn:de:0030-drops-88786}, doi = {10.4230/LIPIcs.CCC.2018.10}, annote = {Keywords: algebraic dependence, Jacobian, Arthur-Merlin, approximate polynomial, satisfiability, hitting-set, border VP, finite field, PSPACE, EXPSPACE, GCT Chasm} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Zeyu Guo, Anand Kumar Narayanan, and Chris Umans. Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 47:1-47:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{guo_et_al:LIPIcs.MFCS.2016.47, author = {Guo, Zeyu and Narayanan, Anand Kumar and Umans, Chris}, title = {{Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.47}, URN = {urn:nbn:de:0030-drops-64609}, doi = {10.4230/LIPIcs.MFCS.2016.47}, annote = {Keywords: algorithms, complexity, finite fields, polynomials, factorization} }
Feedback for Dagstuhl Publishing