2430 search results - page 57 / 486 » Computing Tutte Polynomials |
218
click to vote
AISC
2010
Springer
15 years 7 months ago
2010
Springer
Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus fo...
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
112
Voted
VMV
2000
15 years 3 months ago
2000
Essentially all Computer Vision strategies require initial computation of orientation structure or motion estimation. Although much work has been invested in this subfield, method...
134
Voted
STACS
2009
Springer
15 years 9 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
107
click to vote
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...