research
∙
04/22/2023
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits
Polynomial Identity Testing (PIT) is a fundamental computational problem...
share
research
∙
06/16/2020
Computing Igusa's local zeta function of univariates in deterministic polynomial-time
Igusa's local zeta function Z_f,p(s) is the generating function that cou...
research
∙
06/13/2020
Special-case Algorithms for Blackbox Radical Membership, Nullstellensatz and Transcendence Degree
Radical membership testing, and the special case of Hilbert's Nullstelle...
research
∙
06/05/2020
Utilizing machine learning to prevent water main breaks by understanding pipeline failure drivers
Data61 and Western Water worked collaboratively to apply engineering exp...
research
∙
02/20/2019
Counting basic-irreducible factors mod p^k in deterministic poly-time and p-adic applications
Finding an irreducible factor, of a polynomial f(x) modulo a prime p, is...
research
∙
01/20/2019
Efficiently factoring polynomials modulo p^4
Polynomial factoring has famous practical algorithms over fields– finite...
research
∙
01/28/2018
Algebraic dependencies and PSPACE algorithms in approximative complexity
Testing whether a set f of polynomials has an algebraic dependence is a ...
research
∙
10/09/2017
