182 search results - page 19 / 37 » The Proof Complexity of Polynomial Identities |
ECCC
2010
13 years 8 months ago
2010
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
ISTCS
1995
Springer
14 years 1 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
SIAMCOMP
2000
13 years 9 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
JSC
2010
13 years 8 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...