514 search results - page 43 / 103 » On the Structure of Valiant's Complexity Classes |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
MP
2007
13 years 8 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...