2430 search results - page 149 / 486 » Computing Tutte Polynomials |
129
Voted
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
We provide a characterization of Horn cores for formulas in conjunctive normal form (CNF) and, based on it, a novel algorithm for computing Horn cores of disjunctions of Horn CNFs ...
118
click to vote
AAECC
2000
Springer
15 years 4 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
134
click to vote
MOC
2000
15 years 4 months ago
2000
Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed deg...
143
click to vote
DLT
2009
15 years 2 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
157
Voted
ALT
1995
Springer
15 years 8 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...