3495 search results - page 185 / 699 » On the random satisfiable process |
108
click to vote
WSC
2008
15 years 7 months ago
2008
This paper develops procedures for selecting a set of normal populations with unknown means and unknown variances in order that the final subset of selected populations satisfies ...
146
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
103
click to vote
I3E
2001
15 years 6 months ago
2001
: For an electronic election to be fully democratic there is a need for security mechanisms that will assure the privacy of the voters. With receipt-free electronic voting, a voter...
138
click to vote
CCS
2010
ACM
15 years 4 months ago
2010
ACM
We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic NaorReingold algebraic PRF. Our PRF is the result of adapting the cascade constructio...
140
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...