The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences

DOI10.3103/S1063454107030089zbMath1153.68394OpenAlexW2056628335MaRDI QIDQ946013

N. K. Kosovskii, Tat'yana Matveevna Kosovskaya

Publication date: 22 September 2008

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1063454107030089

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

NP-complete problems for systems of linear polynomial's values divisibilities ⋮ NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine discongruences ⋮ NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine congruences and equations ⋮ NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations

Cites Work

• Unnamed Item
• Unnamed Item
• The NP-completeness column
• STACS 2005

This page was built for publication: The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences