468 search results - page 11 / 94 » One-Way Functions in Complexity Theory |
168
click to vote
PODC
2012
ACM
13 years 6 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
108
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
118
click to vote
JACM
2000
15 years 3 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
129
click to vote
ALIFE
2008
15 years 4 months ago
2008
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...
147
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...