In computational complexity theory, DLOGTIME is the complexity class of all computational problems solvable in a logarithmic amount of computationâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Andreas Krebs, Nutan Limaye
- FSTTCS
- 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

- Fabian Wagner
- MFCS
- 2007

A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are anâ€¦Â (More)

Is this relevant?

2007

2007

- Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
- Acta Informatica
- 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

- Emanuele Viola
- computational complexity
- 2004

We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuitsâ€¦Â (More)

Is this relevant?

2003

2003

- Emanuele Viola
- IEEE Conference on Computational Complexity
- 2003

We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show thatâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- William Hesse, Eric Allender, David A. Mix Barrington
- J. Comput. Syst. Sci.
- 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

- Eric Allender, David A. Mix Barrington, William Hesse
- IEEE Conference on Computational Complexity
- 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

- Birgit Jenner, Pierre McKenzie, Jacobo TorÃ¡n
- IEEE Conference on Computational Complexity
- 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

- Carme Ã€lvarez, Birgit Jenner
- Theor. Comput. Sci.
- 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

- Steven Lindell
- Structure in Complexity Theory Conference
- 1992

Utilizing the connection between uniform constantdepth circuits and first-order logic with numerical predicates, we are able toâ€¦Â (More)

Is this relevant?