612 search results - page 6 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
GI
2004
Springer
14 years 1 months ago
2004
Springer
: A concept for identification of candidates for outliers is presented, with a focus on nominal variables. The database concerned is searched for rules that are almost universally...
IJCV
2006
13 years 7 months ago
2006
In this paper, we suggest a variational model for optic flow computation based on non-linearised and higher order constancy assumptions. Besides the common grey value constancy ass...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...