7106 search results - page 66 / 1422 » Restricted Complexity, General Complexity |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
ATAL
2003
Springer
14 years 28 days ago
2003
Springer
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
FPLAY
2008
13 years 9 months ago
2008
Conflict theory can be used to explain the interactions between societies during times of turmoil and change (i.e. revolutions, strikes or everyday debates). Games have been produ...
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
14 years 2 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...