2766 search results - page 328 / 554 » Algorithms for trigonometric polynomials |
108
click to vote
COCO
1994
Springer
15 years 8 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
134
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
116
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
154
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
187
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...