18090 search results - page 708 / 3618 » Computing by Only Observing |
195
click to vote
CSR
2008
Springer
15 years 9 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
159
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if
163
click to vote
COMPGEOM
2004
ACM
16 years 21 days ago
2004
ACM
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
147
click to vote
MFCS
1990
Springer
15 years 11 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
170
click to vote
CSR
2007
Springer
15 years 11 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...