1920 search results - page 75 / 384 » The Complexity of the A B C Problem |
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
210
Voted
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
124
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
: One of the main practical problems on cooperative robots is the complexity of integrating a large amount of expensive velocity/force sensors. In this paper, the control of cooper...
157
click to vote
JCT
2006
15 years 6 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...
120
Voted
JCT
2011
15 years 1 months ago
2011
We consider the problem of orienting the edges of the n-dimensional hypercube so only two different in-degrees a and b occur. We show that this can be done, for two specified in...