2430 search results - page 144 / 486 » Computing Tutte Polynomials |
147
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
151
click to vote
ISSAC
1997
Springer
15 years 9 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
141
Voted
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f
155
click to vote
DLT
2006
15 years 6 months ago
2006
Abstract. Tree series transformations computed by polynomial topdown and bottom-up tree series transducers are considered. The hierarchy of tree series transformations obtained in ...
124
click to vote
NETWORKS
2010
15 years 3 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.