On Computational Complexity of Semilinear Varieties

DOI10.1093/logcom/exn017zbMath1157.03011OpenAlexW1990761403MaRDI QIDQ3549316

Enrico Marchioni

Publication date: 22 December 2008

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn017

zbMATH Keywords

computational complexityvarietiesuninormstriangular normssemilinear functionsordered divisible abelian groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Equational classes, universal algebra in model theory (03C05) Varieties (08B99)

Related Items (1)

Proof search and co-NP completeness for many-valued logics

This page was built for publication: On Computational Complexity of Semilinear Varieties