P. Gastin
-
The word problem for 1LC congruences is NP-hard
Theoretical Computer Science
Infinite Product of Traces Represented by Projections
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)