4940 search results - page 2 / 988 » On the Complexity of Universal Programs |
190
Voted
ALGOSENSORS
2007
Springer
16 years 17 days ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
218
Voted
CSL
2007
Springer
16 years 16 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
179
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
144
Voted
WSC
2007
15 years 8 months ago
2007
Simulation modelers have a diversity of educational backgrounds including several engineering and scientific disciplines, mathematics and computer related fields. Many of the skil...
182
Voted
ICALP
2007
Springer
16 years 16 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...