Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
William Hesse
2000 – 2009
- 2006
[c7]William Hesse: Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures. Circuits, Logic, and Games 2006- 2003
[j2]William Hesse: The dynamic complexity of transitive closure is in DynTC0. Theor. Comput. Sci. 296(3): 473-485 (2003)
[c6]- 2002
[j1]William Hesse, Eric Allender, David A. Mix Barrington: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65(4): 695-716 (2002)
[c5]
[c4]- 2001
[c3]Eric Allender, David A. Mix Barrington, William Hesse: Uniform Circuits for Division: Consequences and Problems. IEEE Conference on Computational Complexity 2001: 150-159
[c2]
[c1]
[i1]Eric Allender, David A. Mix Barrington, William Hesse: Uniform Circuits for Division: Consequences and Problems. Electronic Colloquium on Computational Complexity (ECCC) 8(33) (2001)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-23 20:55 CET by the dblp team



