13987 search results - page 249 / 2798 » The Two Guards Problem |
131
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
133
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
134
click to vote
ICOIN
2005
Springer
15 years 9 months ago
2005
Springer
Multi-hop ad hoc wireless networks generally use the IEEE 802.11 Distributed Coordination Function (DCF) MAC protocol, which utilizes the request-to-send/clear-to-send (RTS/CTS) me...
120
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
136
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...