Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets

DOI10.17223/20710410/64/1MaRDI QIDQ6573396FDOQ6573396

Authors: A. Yu. Nikitin, N. D. Kudyk 

Publication date: 16 July 2024

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

zbMATH Keywords

computational complexityconespartially ordered setsolvabilityposetsystems of equationsequationally Noetherian property

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites Work

• List homomorphisms to reflexive graphs
• Title not available (Why is that?)
• Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms

This page was built for publication: Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573396)