scientific article; zbMATH DE number 7166710

DOI10.4086/toc.2019.v015a016zbMath1456.68058OpenAlexW2996793588MaRDI QIDQ5215662

Zeyu Guo, Nitin Saxena, Amit Sinhababu

Publication date: 12 February 2020

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2019.v015a016

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Jacobianfinite fieldalgebraic dependencesatisfiabilityapproximate polynomialPSPACEhitting setEXPSPACEArthur-Merlinborder VPGCT chasmpolynomial identity lemma

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (2)

A note on VNP-completeness and border complexity ⋮ Blackbox identity testing for sum of special ROABPs and its border class

This page was built for publication: