14774 search results - page 85 / 2955 » Computational complexity and evolutionary computation |
166
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
123
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
127
click to vote
TARK
2007
Springer
15 years 10 months ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
135
click to vote
COLT
2000
Springer
15 years 8 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
129
click to vote
ICMAS
2000
15 years 5 months ago
2000
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...