Sciweavers

2661 search results - page 137 / 533
» Quantum Complexity Classes
Sort
View
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
15 years 1 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
IEAAIE
2010
Springer
15 years 1 months ago
S.cerevisiae Complex Function Prediction with Modular Multi-Relational Framework
Gene functions is an essential knowledge for understanding how metabolism works and designing treatments for solving malfunctions. The Modular Multi-Relational Framework (MMRF) is ...
Beatriz García Jiménez, Agapito Lede...
WINE
2010
Springer
251views Economy» more  WINE 2010»
15 years 1 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis
TIT
2010
122views Education» more  TIT 2010»
14 years 10 months ago
Biological information as set-based complexity
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
David J. Galas, Matti Nykter, Gregory W. Carter, N...
EUROCRYPT
2005
Springer
15 years 8 months ago
Reducing Complexity Assumptions for Statistically-Hiding Commitment
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-...