2412 search results - page 64 / 483 » Which Problems Have Strongly Exponential Complexity |
IJCAI
2001
14 years 16 days ago
2001
Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many...
ASIACRYPT
2010
Springer
13 years 9 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
ICDE
2003
IEEE
15 years 15 days ago
2003
IEEE
Determining relationships such as functional or inclusion dependencies within and across databases is important for many applications in information integration. When such informa...
FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...