3946 search results - page 31 / 790 » The computational complexity of choice sets |
94
Voted
AAAI
2000
15 years 1 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
COMGEO
2008
ACM
14 years 12 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
101
click to vote
ICALP
2009
Springer
16 years 1 days ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
JAR
2006
14 years 11 months ago
2006
SET (Secure Electronic Transaction) is a suite of protocols proposed by a consortium of credit card companies and software corporations to secure ecommerce transactions. The Purcha...