1092 search results - page 5 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
COCO
2009
Springer
15 years 4 months ago
2009
Springer
ISSAC
2007
Springer
15 years 3 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...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
MST
2011
14 years 10 days ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...