1225 search results - page 174 / 245 » The Instance Complexity Conjecture |
PKC
2005
Springer
14 years 2 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
ROBOCUP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
Auctions are useful mechanisms for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders know their own valua...
CAISE
2004
Springer
14 years 2 months ago
2004
Springer
: While some information modeling approaches (e.g. the Relational Model, and Object-Role Modeling) are typically formalized using first-order logic, other approaches to information...
CSL
2004
Springer
14 years 2 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...