scientific article; zbMATH DE number 7150624
From MaRDI portal
Publication:5207889
zbMath1428.68164MaRDI QIDQ5207889
Ramprasad Saptharishi, Mrinal Kumar
Publication date: 13 January 2020
Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/591/599
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Unnamed Item ⋮ Factorization of polynomials given by arithmetic branching programs ⋮ Factorization of polynomials given by arithmetic branching programs
This page was built for publication:
