Reductions and functors from problems to word problems
From MaRDI portal
Publication:1566706
DOI10.1016/S0304-3975(98)00131-5zbMATH Open0947.68537OpenAlexW1997172367MaRDI QIDQ1566706FDOQ1566706
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00131-5
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Isoperimetric functions of groups and computational complexity of the word problem
- Infinite string rewrite systems and complexity
- Isoperimetric and isodiametric functions of groups
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- Embedding Theorems with Amalgamation for Semigroups†
- Confluent and Other Types of Thue Systems
- Real-Time Simulation of Multihead Tape Units
- Time/Space Trade-Offs for Reversible Computation
- New Real-Time Simulations of Multihead Tape Units
- Dehn's Algorithm and the Complexity of Word Problems
Cited In (2)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Foundations of Software Science and Computation Structures 👍 👎
- Rudimentary reductions revisited 👍 👎
- Reverse Mathematics 👍 👎
- On reduction theorems in the problem of composition of functions 👍 👎
- Classifying word problems of finitely generated algebras via computable reducibility 👍 👎
This page was built for publication: Reductions and functors from problems to word problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566706)
