681 search results - page 3 / 137 » General Polynomial Time Decomposition Algorithms |
FUIN
2007
13 years 4 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
GIAE
2004
Springer
13 years 10 months ago
2004
Springer
For a first order autonomous ODE, we give a polynomial time algorithm to decide whether it has a polynomial general solution and to compute one if it exists. Experiments show that...
SPIRE
2007
Springer
13 years 11 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...