2168 search results - page 252 / 434 » Randomized Algorithms and Complexity Theory |
133
Voted
CPM
2004
Springer
15 years 7 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
154
Voted
COCO
2008
Springer
15 years 5 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
144
click to vote
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
137
Voted
KER
2008
15 years 3 months ago
2008
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
157
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...