1511 search results - page 5 / 303 » Randomness, lowness and degrees |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
MLQ
2000
14 years 11 months ago
2000
We give a corrected proof of an extension of the Robinson Splitting Theorem for the d.c.e. degrees. The purpose of this short paper is to clarify and correct the main result and p...
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
JOC
2011
14 years 6 months ago
2011
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...