16666 search results - page 300 / 3334 » Descriptive and Computational Complexity |
178
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We propose a computational model that facilitates agents in a MAS to collaboratively evolve their norms to reach the best norm conventions. Our approach borrows from the social con...
182
click to vote
DLT
2003
15 years 8 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
167
click to vote
TCS
2010
15 years 1 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
188
click to vote
COCO
2005
Springer
16 years 6 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
208
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...