664 search results - page 1 / 133 » Some results for a class of generalized polynomials |
ADCM
2000
13 years 5 months ago
2000
ICDT
1995
ACM
13 years 9 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
JSAT
2008
13 years 5 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
IWOCA
2010
Springer
13 years 18 days ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
GECCO
2000
Springer
13 years 9 months ago
2000
Springer
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...