1383 search results - page 110 / 277 » On the Complexity of the Interlace Polynomial |
204
click to vote
FSTTCS
1992
Springer
15 years 10 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
164
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
226
click to vote
STACS
1993
Springer
15 years 10 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
163
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
187
click to vote
ATAL
2009
Springer
16 years 28 days ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...