1383 search results - page 209 / 277 » On the Complexity of the Interlace Polynomial |
125
click to vote
BIRTHDAY
2010
Springer
15 years 3 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...
115
click to vote
SIGECOM
2010
ACM
15 years 2 months 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....
147
click to vote
AI
2010
Springer
15 years 2 months 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...
125
click to vote
CORR
2010
Springer
15 years 2 months 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...
155
Voted
AOR
2006
15 years 2 months ago
2006
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...