2430 search results - page 167 / 486 » Computing Tutte Polynomials |
188
click to vote
LICS
2000
IEEE
15 years 9 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
123
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
126
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of ...
127
click to vote
ICML
1996
IEEE
16 years 5 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
146
Voted
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...