scientific article; zbMATH DE number 3921983
From MaRDI portal
Publication:3696522
Recommendations
Cited in
(23)- Complexity of matching problems
- Associative-commutative unification
- Tight complexity bounds for term matching problems
- Adventures in associative-commutative unification
- A term equality problem equivalent to graph isomorphism
- Single elementary associative-commutative matching
- The complexity of linear and stratified context matching problems
- Multitree automata that count
- Complete sets of unifiers and matchers in equational theories
- The complexity of counting problems in equational matching
- On the complexity of optimal matching reconfiguration
- scientific article; zbMATH DE number 4191126 (Why is no real title available?)
- The Complexity of Rationalizing Matchings
- scientific article; zbMATH DE number 4049047 (Why is no real title available?)
- From heaps of matches to the limits of computability
- scientific article; zbMATH DE number 1931655 (Why is no real title available?)
- scientific article; zbMATH DE number 1405696 (Why is no real title available?)
- Some complexity theoretic aspects of AC rewriting
- The complexity of counting problems in equational matching
- Computational complexity of simultaneous elementary matching problems
- Parameterized complexity of perfectly matched sets
- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete
- Solving (large scale) matching problems combinatorially
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696522)
