scientific article; zbMATH DE number 1754588
From MaRDI portal
Publication:4535013
zbMath0986.68041MaRDI QIDQ4535013
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760104
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
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}\) ⋮ 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 ⋮ TC^0 circuits for algorithmic problems in nilpotent groups ⋮ A model-theoretic characterization of constant-depth arithmetic circuits ⋮ On the complexity of some problems on groups input as multiplication tables ⋮ Conjugacy in Baumslag's group, generic case complexity, and division in power circuits ⋮ Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) ⋮ On the Complexity of Szilard Languages of Regulated Grammars
This page was built for publication:
