Book ChapterDOI
Testing Polynomial Equivalence by Scaling Matrices
Markus Bläser,B. V. Raghavendra Rao,Jayalal Sarma +2 more
- pp 111-122
Reads0
Chats0
TLDR
This paper studies the polynomial equivalence problem: test if two given polynomials f and g are equivalent under a non-singular linear transformation of variables.Abstract:
In this paper we study the polynomial equivalence problem: test if two given polynomials f and g are equivalent under a non-singular linear transformation of variables.read more
Citations
More filters
Journal Article
Testing Equivalence of Polynomials under Shifts.
TL;DR: In this paper, a deterministic algorithm for shift-equivalent testing was proposed, which runs in time polynomial in the circuit size of the polynomials, to which it is given black box access.
References
More filters
Book
Algebraic Complexity Theory
TL;DR: This is the first book to present an up-to-date and self-contained account of Algebraic Complexity Theory that is both comprehensive and unified.
Book ChapterDOI
Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms
TL;DR: Two new families of Asymmetric Algorithms that so far have resisted all attacks, if properly used: Hidden Field Equations (HFE) and Isomorphism of Polynomials (IP) are presented.
Proceedings ArticleDOI
Some algebraic and geometric computations in PSPACE
TL;DR: A PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial equations is given and it is shown that the existential theory of the real numbers can be decided in PSPACE.
Algebraic Complexity Theory.
TL;DR: Algebraic complexity theory as mentioned in this paper is a project of lower bounds and optimality, which unifies two quite different traditions: mathematical logic and the theory of recursive functions, and numerical algebra.
Journal ArticleDOI
Derandomizing polynomial identity tests means proving circuit lower bounds
TL;DR: If Permanent requires superpolynomial-size arithmetic circuits, then one can test in subexponential time whether a given arithmetic circuit of polynomially bounded degree computes an identically zero polynomial.