2430 search results - page 148 / 486 » Computing Tutte Polynomials |
145
click to vote
ASIACRYPT
2004
Springer
15 years 10 months ago
2004
Springer
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
167
click to vote
ICTCS
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
138
click to vote
RECOMB
1997
Springer
15 years 9 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
107
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We study the learning models defined in [AKST97]: Learning with equivalence and limited membership queries and learning with equivalence and malicious membership queries. We show ...
119
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...