1568 search results - page 110 / 314 » The problem of examination questions in algorithmics |
136
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
128
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another obj...
110
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
132
click to vote
SIGIR
2005
ACM
15 years 10 months ago
2005
ACM
Information retrieval is, in general, an iterative search process, in which the user often has several interactions with a retrieval system for an information need. The retrieval ...
164
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...