2446 search results - page 4 / 490 » Choiceless Polynomial Time |
150
click to vote
ICALP
2010
Springer
15 years 8 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...
132
Voted
SDM
2009
SIAM
16 years 20 days ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
130
click to vote
GIAE
2004
Springer
15 years 8 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...
140
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
130
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...