2430 search results - page 75 / 486 » Computing Tutte Polynomials |
151
click to vote
NMR
2004
Springer
15 years 8 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
147
Voted
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
116
click to vote
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
This work presents a new approach to contour representation and coding. It consists of an improved fitting of high-degree (4th to 18th ) implicit polynomials (IPs) to the contour,...
111
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
107
Voted
COCO
2006
Springer
15 years 4 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...