2430 search results - page 249 / 486 » Computing Tutte Polynomials |
115
click to vote
DAGSTUHL
2008
15 years 5 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
116
click to vote
IPCO
2007
15 years 5 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
128
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
140
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
126
Voted
AAAI
2004
15 years 5 months ago
2004
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 boo...