976 search results - page 57 / 196 » The Complexity of Timetable Construction Problems |
ICISC
2007
13 years 10 months ago
2007
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
EELC
2006
14 years 23 days ago
2006
nstructional schemas, both specific and abstract. Children are thought to start out with concrete pieces of language and to gradually develop more schematic constructions. All cons...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...