scientific article; zbMATH DE number 1754588
From MaRDI portal
Publication:4535013
zbMATH Open0986.68041MaRDI QIDQ4535013FDOQ4535013
Authors: William Hesse 
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760104
Title of this publication is not available (Why is that?)
Recommendations
- Division in logspace-uniform NC
- The uniform rule in the division problem
- On the division by \(\mathbf R^ n\)
- Division formulas in \({\mathbb C}^n\)
- scientific article; zbMATH DE number 7158657
- Division by zero in non-involutive meadows
- Division in the Theory S02+ of Bounded Arithmetic.
- scientific article; zbMATH DE number 3932382
- scientific article; zbMATH DE number 4069849
- A Note on Divisibility in H∞(X)
Cited In (17)
- On the complexity of Szilard languages of regulated grammars
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- Descriptive complexity of \#P functions: a new perspective
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)
- \(\mathsf{TC}^0\) circuits for algorithmic problems in nilpotent groups
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
- A model-theoretic characterization of constant-depth arithmetic circuits
- Division in logspace-uniform NC
- On the complexity of some problems on groups input as multiplication tables
- Low-depth uniform threshold circuits and the bit-complexity of straight line programs
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
- Fast Parallel Arithmetic via Modular Representation
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\)
- Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535013)
