363 search results - page 35 / 73 » Finding Small Solutions to Small Degree Polynomials |
DM
2010
13 years 7 months ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
FOCS
1999
IEEE
14 years 9 hour 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...
TNN
2010
13 years 2 months ago
2010
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...