Sciweavers

13603 search results - page 331 / 2721
» On the Complexity of Computing Treelength
Sort
View
202
Voted
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 12 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 7 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
AI
2006
Springer
15 years 7 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
DAGSTUHL
2010
15 years 9 months ago
Exploring Visualization Methods for Complex Variables
Applications of complex variables and related manifolds appear throughout mathematics and science. Here we review a family of basic methods for applying visualization concepts to ...
Andrew J. Hanson, Ji-Ping Sha
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 27 days ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang