2435 search results - page 377 / 487 » Intellexer Question Answering |
113
click to vote
CC
2006
Springer
15 years 22 days ago
2006
Springer
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
114
Voted
COMBINATORICS
2006
15 years 22 days ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
COMBINATORICS
2006
15 years 22 days ago
2006
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
119
click to vote
CORR
2006
Springer
15 years 22 days ago
2006
Springer
In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledg...
82
Voted
COMBINATORICS
2007
15 years 21 days ago
2007
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...