2430 search results - page 102 / 486 » Computing Tutte Polynomials |
139
click to vote
WAIFI
2010
Springer
15 years 10 months ago
2010
Springer
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
160
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
167
Voted
ASAP
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
130
click to vote
IJCAI
1993
15 years 6 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
151
Voted
JMLR
2006
15 years 5 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...