On complexity of the satisfiability problem of systems over finite posets
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- Symmetric matrices whose entries are linear functions
- Itemset frequency satisfiability: complexity and axiomatization
- Systems of Diophantine equations over finite configurations
- Computational complexity of solving equation systems
- Solving equations over small unary algebras
- System Completion Problem: Theory and Applications
- scientific article; zbMATH DE number 4114007 (Why is no real title available?)
- Decidability of the restricted theories of a class of partial orders
- The NP-completeness of the consistency problem for systems of Diophantine equations over finite configurations
- Axiomatizability and decidability of universal theories of hereditary classes of models of finite and infinite languages
This page was built for publication: On complexity of the satisfiability problem of systems over finite posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151206)