3208 search results - page 241 / 642 » A Lower Bound for Primality |
181
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
190
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
157
click to vote
INFOCOM
1992
IEEE
15 years 10 months ago
1992
IEEE
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
174
click to vote
ESORICS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impract...
166
click to vote
3DIM
2005
IEEE
15 years 8 months ago
2005
IEEE
We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in...