2430 search results - page 119 / 486 » Computing Tutte Polynomials |
131
click to vote
TCS
1998
15 years 4 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
229
click to vote
IWPEC
2010
Springer
15 years 2 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
130
click to vote
JACM
2000
15 years 4 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
139
click to vote
ICPPW
2006
IEEE
15 years 11 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
154
click to vote
ISTCS
1993
Springer
15 years 9 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...