2446 search results - page 342 / 490 » Choiceless Polynomial Time |
STOC
1992
ACM
13 years 12 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
ISSAC
1989
Springer
13 years 12 months ago
1989
Springer
: We present a modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctnes...
DBPL
2007
Springer
13 years 12 months ago
2007
Springer
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...
ANTS
2010
Springer
13 years 11 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...