787 search results - page 3 / 158 » Polynomial Constants are Decidable |
COCO
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
ICDT
2007
ACM
14 years 2 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
PLANX
2007
13 years 9 months ago
2007
Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equiva...