Pages that link to "Item:Q946013"
From MaRDI portal
The following pages link to The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences (Q946013):
Displaying 5 items.
- The polynomial decision algorithm for Boolean solution of polynomial congruencies by power prime modulo (Q849169) (← links)
- NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations (Q1709490) (← links)
- NP-complete problems for systems of linear polynomial's values divisibilities (Q2402582) (← links)
- NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine discongruences (Q2404747) (← links)
- NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine congruences and equations (Q2404767) (← links)