1379 search results - page 106 / 276 » The Complexity of the Annihilating Polynomial |
129
click to vote
ISAAC
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
178
click to vote
CHES
2005
Springer
15 years 12 months ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
176
click to vote
FSTTCS
2005
Springer
15 years 12 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
138
click to vote
COCO
1998
Springer
15 years 10 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
171
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...