1695 search results - page 77 / 339 » Linear, Polynomial or Exponential |
127
click to vote
FOCS
1999
IEEE
15 years 8 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...
123
click to vote
DCC
2002
IEEE
15 years 3 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
131
Voted
TCS
2011
14 years 11 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
154
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
201
click to vote
ISSAC
1997
Springer
15 years 8 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...