Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

DLOGTIME

In computational complexity theory, DLOGTIME is the complexity class of all computational problems solvable in a logarithmic amount of computation… Expand
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… Expand
2012
2012
We define DLOGTIME proof systems, DLTPS, which generalize NC0 proof systems. It is known that functions such as Exact_k and… Expand
2007
2007
We present translational lemmas for the three standard models of parallel computation, and apply them to obtain tight hierarchy… Expand
2006
2006
We study the complexity of arithmetic in finite fields of characteristic two, $\mathbb{F}_{2^n}$. We concentrate on the following… Expand
  • table 1
  • table 2
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2004
2004
We present complexity hierarchies on circuits under two DLOGTIME-uniformity conditions. It is shown that there is a language… Expand
Highly Cited
2002
Highly Cited
2002
It has been known since the mid-1980s (SIAM J. Comput. 15 (1986) 994; SIAM J. Comput. 21 (1992) 896) that integer division can be… Expand
2001
2001
We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i.e., a… Expand
1998
1998
  • H. Veith
  • Inf. Comput.
  • 1998
  • Corpus ID: 206566374
Abstract In this article, the following results are shown: 1. For succinctly encoded problems s ( A ), completeness under… Expand
1989
1989
WE CONSIDER THE RELATIVE COMPLEXITY OF A NUMBER OF LANGUAGES KNOWN TO BE IN UNIFORM `NC(SUPERSCRIPT)1'', USING THE DESCRIPTIVE… Expand