Pages that link to "Item:Q5151206"
From MaRDI portal
The following pages link to ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS (Q5151206):
Displaying 5 items.
- Symmetric matrices whose entries are linear functions (Q2206413) (← links)
- Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
- Systems of Diophantine equations over finite configurations (Q2691809) (← links)
- System Completion Problem: Theory and Applications (Q4625781) (← links)
- DECIDABILITY OF THE RESTRICTED THEORIES OF A CLASS OF PARTIAL ORDERS (Q5151271) (← links)