2996 search results - page 83 / 600 » Numberings and Randomness |
86
Voted
COMBINATORICS
2004
15 years 15 days ago
2004
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
AAAI
2000
15 years 2 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
CORR
2011
Springer
14 years 7 months ago
2011
Springer
: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
70
Voted
EACL
2006
ACL Anthology
15 years 2 months ago
2006
ACL Anthology
In this paper, we present an automated, quantitative, knowledge-poor method to evaluate the randomness of a collection of documents (corpus), with respect to a number of biased pa...
89
Voted
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...