1007 search results - page 25 / 202 » The Complexity of Futile Questioning |
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
SCHOLARPEDIA
2008
13 years 8 months ago
2008
ABSTRACT. We discuss a special eigenstate of the quantized periodic CalogeroMoser system associated to a root system. This state has the property that its eigenfunctions, when rega...
TCOM
2010
13 years 8 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
ALIFE
2008
13 years 9 months ago
2008
While complex systems have been studied now for more than two decades, there still is no agreement on what complexity actually is. This lack of a definition might be a problem when...