432 search results - page 21 / 87 » Open Problems with Part-Whole Relations |
82
Voted
SODA
2004
ACM
15 years 1 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
104
click to vote
JCT
2010
14 years 7 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
156
Voted
AAMAS
2011
Springer
14 years 7 months ago
2011
Springer
In cooperative multi-agent systems, roles are used as a design concept when creating large systems, they are known to facilitate specialization of agents, and they can help to redu...
102
Voted
DBPL
1997
Springer
15 years 4 months ago
1997
Springer
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
110
Voted
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...