2233 search results - page 371 / 447 » On the Complexity of Theory Curbing |
COCO
1994
Springer
14 years 6 days ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
SIGMOD
1993
ACM
14 years 5 days ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
AFRIGRAPH
2007
ACM
14 years 3 days ago
2007
ACM
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
PODC
2010
ACM
14 years 2 hour ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
PODC
2010
ACM
14 years 2 hour ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...