2766 search results - page 61 / 554 » Algorithms for trigonometric polynomials |
95
Voted
SAT
2007
Springer
15 years 6 months ago
2007
Springer
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
107
Voted
CASC
2010
Springer
14 years 11 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
MICS
2010
14 years 11 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
102
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
110
click to vote
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...