1383 search results - page 107 / 277 » On the Complexity of the Interlace Polynomial |
176
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...
175
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...
135
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 ...
135
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...