1998 search results - page 308 / 400 » Complexity of the Cover Polynomial |
105
Voted
AAAI
2006
15 years 2 months ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
113
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
105
Voted
SIGECOM
2010
ACM
15 years 26 days ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
136
click to vote
AI
2010
Springer
15 years 24 days ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
106
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...