2957 search results - page 80 / 592 » The Complexity of Polynomial-Time Approximation |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
CSL
2010
Springer
13 years 7 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
JACM
2010
13 years 6 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...