4940 search results - page 2 / 988 » On the Complexity of Universal Programs |
ALGOSENSORS
2007
Springer
14 years 4 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...
CSL
2007
Springer
14 years 4 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 ï...
CORR
2010
Springer
13 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...
WSC
2007
13 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...
ICALP
2007
Springer
14 years 3 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...