314 search results - page 5 / 63 » Complete Problems for Dynamic Complexity Classes |
ALT
2003
Springer
14 years 4 months ago
2003
Springer
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
CEC
2005
IEEE
13 years 9 months ago
2005
IEEE
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
CIE
2009
Springer
14 years 1 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)