The Computational Complexity of Iterated Elimination of Dominated Strategies.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 52, doi. 10.1007/s00224-015-9637-1
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2016 AND VI 59 AND IP 1
Results: 7
1
2
Complexity of Approximating CSP with Balance / Hard Constraints.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 76, doi. 10.1007/s00224-015-9638-0
- By:
- Publication type:
- Article
3
On the Parameterised Complexity of String Morphism Problems.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 24, doi. 10.1007/s00224-015-9635-3
- By:
- Publication type:
- Article
4
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 99, doi. 10.1007/s00224-015-9639-z
- By:
- Publication type:
- Article
5
The Update Complexity of Selection and Related Problems.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 112, doi. 10.1007/s00224-015-9664-y
- By:
- Publication type:
- Article
6
Holant Problems for 3-Regular Graphs with Complex Edge Functions.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 133, doi. 10.1007/s00224-016-9671-7
- By:
- Publication type:
- Article
7
On the Stability of Generalized Second Price Auctions with Budgets.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 1, doi. 10.1007/s00224-015-9634-4
- By:
- Publication type:
- Article