Skip to search formSkip to main contentSkip to account menu

DLOGTIME

In computational complexity theory, DLOGTIME is the complexity class of all computational problems solvable in a logarithmic amount of computation… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Separations among the first order logic Ring(0,+, ∗) of finite residue class rings, its extensions with generalized quantifiers… 
2011
2011
2007
2007
We present translational lemmas for the three standard models of parallel computation, and apply them to obtain tight hierarchy… 
2005
2005
We study the complexity of arithmetic in finite fields of characteristic two, $\mathbb{F}_{2^n}$. We concentrate on the following… 
Highly Cited
2004
Highly Cited
2004
We investigate the incremental validation of XML documents with respect to DTDs, specialized DTDs, and XML Schemas, under updates… 
2004
2004
We present complexity hierarchies on circuits under two DLOGTIME-uniformity conditions. It is shown that there is a language… 
Highly Cited
2002
2001
2001
We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i.e., a… 
1991
1991
1989