DLOGTIME

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

Topic mentions per year

Topic mentions per year

1989-2017
01219892017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We define DLOGTIME proof systems, DLTPS, which generalize NC0 proof systems. It is known that functions such as Exactk and… (More)
Is this relevant?
2007
2007
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
We present translational lemmas for the three standard models of parallel computation, and apply them to obtain tight hierarchy… (More)
Is this relevant?
2004
2004
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits… (More)
  • table 1.1
Is this relevant?
2003
2003
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that… (More)
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
It has been known since the mid-1980's [15, 46, 47] that integer division can be performed by poly-time uniform constant-depth… (More)
Is this relevant?
2000
2000
Integer division has been known to lie in P-uniform TC since the mid1980’s, and recently this was improved to L-uniform TC. At… (More)
Is this relevant?
1998
1998
We prove that the tree isomorphism problem, when trees are encoded as strings, is NC 1-hard under DLOGTIME-reductions. NC 1… (More)
Is this relevant?
1995
1995
We investigate properties of the relativized AC and NC hierarchies in their DLOGTIME-, respectively, ALOGTIME-uniform setting and… (More)
Is this relevant?
1992
1992
Utilizing the connection between uniform constantdepth circuits and first-order logic with numerical predicates, we are able to… (More)
Is this relevant?