1772 search results - page 111 / 355 » Classifying Problems into Complexity Classes |
171
click to vote
SSPR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
167
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
164
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...
141
click to vote
MFCS
1989
Springer
15 years 10 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
165
click to vote
IDEAL
2005
Springer
15 years 12 months ago
2005
Springer
The design, development, and use of complex systems models raises a unique class of challenges and potential pitfalls, many of which are commonly recurring problems. Over time, res...