2430 search results - page 210 / 486 » Computing Tutte Polynomials |
133
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
131
click to vote
ACNS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This work presents a new method to compute the GHASH function involved in the Galois/Counter Mode of operation for block ciphers. If X = X1 . . . Xn is a bit string made ...
130
click to vote
COCO
2001
Springer
15 years 9 months ago
2001
Springer
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
147
click to vote
LPNMR
2001
Springer
15 years 9 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
143
click to vote
NIPS
2007
15 years 5 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...