The following pages link to (Q4535013):
Displaying 16 items.
- Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication'' (Q386053) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- The dynamic complexity of transitive closure is in DynTC\(^{0}\). (Q1401284) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) (Q2399376) (← links)
- Division in logspace-uniform NC (Q2773023) (← links)
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
- On the Complexity of Szilard Languages of Regulated Grammars (Q3105746) (← links)
- Fast Parallel Arithmetic via Modular Representation (Q3978178) (← links)
- TC^0 circuits for algorithmic problems in nilpotent groups (Q5111237) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- On the complexity of some problems on groups input as multiplication tables (Q5956010) (← links)
