15033 search results - page 128 / 3007 » Complexity Theory and Algorithms |
126
click to vote
JC
2008
15 years 3 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
144
click to vote
JACM
2007
15 years 3 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
134
click to vote
SMC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Considerable attention is now being devoted to the study of “complexity science” with the intent of discovering and applying universal laws of highly interconnected and evo...
110
Voted
EATCS
2002
15 years 3 months ago
2002
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
108
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...