Complexity results for confluence problems
From MaRDI portal
Recommendations
- Complexity results for the spanning tree congestion problem
- Computational complexity and the conjugacy problem
- Capacitated Confluent Flows: Complexity and Algorithms
- Complexity of the generalized conjugacy problem
- scientific article; zbMATH DE number 3950169
- Algorithms and complexity analysis for some flow problems
- The parallel complexity of two problems on concurrency
- Approximation algorithms and hardness of integral concurrent flow
- Polynomial-time algorithms for special cases of the maximum confluent flow problem
- Complexity results on the conjugacy problem for monoids
Cited in
(15)- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- On confluent semi-commutations: Decidability and complexity results
- Confluence problems for trace rewriting systems
- scientific article; zbMATH DE number 1615237 (Why is no real title available?)
- Algorithms and reductions for rewriting problems
- Complexity of a classical flow restoration problem
- scientific article; zbMATH DE number 4024775 (Why is no real title available?)
- scientific article; zbMATH DE number 4051589 (Why is no real title available?)
- scientific article; zbMATH DE number 176737 (Why is no real title available?)
- The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties
- On confluence versus strong confluence for one-rule trace-rewriting systems
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- Word problems over traces which are solvable in linear time
- Computer Aided Verification
- Word problems over traces which are solvable in linear time
This page was built for publication: Complexity results for confluence problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941894)
