15033 search results - page 51 / 3007 » Complexity Theory and Algorithms |
96
Voted
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
106
Voted
SIGACT
2010
15 years 1 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
111
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
JSYML
2006
15 years 3 months ago
2006
Abstract. We characterise strongly minimal groups interpretable in elementary extensions of compact complex analytic spaces.
128
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...