395 search results - page 12 / 79 » Positive Versions of Polynomial Time |
STOC
1996
ACM
15 years 1 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
120
click to vote
SODA
2012
ACM
13 years 7 days ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
FOCS
2006
IEEE
15 years 3 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...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
In this paper, we present an algorithm that given a fixed prime power q and a positive integer N, finds an integer n [N, 2qN] and an element Fqn of order greater than 5.8n/ log...
CORR
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...