Highlights 2014
Decidability of the Weak Bruhat Ordering on Permutations via MSOL and S1S
Abstract
We prove that the equational theory of all the permutohedra is decidable. 17: 00 17: 15 Break
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- Highlights of Logic, Games and Automata
- Archive span
- 2013-2025
- Indexed papers
- 1236
- Paper id
- 538004625310204204