6274 search results - page 58 / 1255 » From query complexity to computational complexity |
98
Voted
STACS
2000
Springer
15 years 6 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
120
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
140
Voted
IJCAI
1993
15 years 4 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
100
Voted
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
104
Voted
RECOMB
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. Clusters of genes that evolved from single progenitors via repeated segmental duplications present significant challenges to the generation of a truly complete human geno...