Pages that link to "Item:Q4649509"
From MaRDI portal
The following pages link to POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY (Q4649509):
Displaying 12 items.
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. (Q408527) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P (Q2254512) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- The conjugacy problem for Higman’s group (Q4970526) (← links)
- (Q5090487) (← links)
- (Q5092405) (← links)
- Complexity of word problems for HNN-extensions (Q5925702) (← links)
- Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)
- Improved parallel algorithms for generalized Baumslag groups (Q6164005) (← links)