2430 search results - page 170 / 486 » Computing Tutte Polynomials |
140
click to vote
CORR
2012
Springer
14 years 13 days ago
2012
Springer
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
112
click to vote
CCA
2009
Springer
15 years 11 months ago
2009
Springer
We exhibit a polynomial time computable plane curve Γ that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For...
137
Voted
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
149
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
We report on a high-level categorical parallel framework, written in the Aldor language, to support high-performance computer algebra on symmetric multi-processors and multicore p...
132
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...