Systems of Diophantine equations over finite configurations

DOI10.1134/S0037446623020076OpenAlexW4360831352MaRDI QIDQ2691809

N. T. Kogabaev

Publication date: 30 March 2023

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446623020076

zbMATH Keywords

incidencecomputational complexityconfigurationsystem of equations

Mathematics Subject Classification ID

Model theory (03Cxx) Varieties (08Bxx) Other classes of algebras (08Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic geometry over algebraic structures. II: Foundations
• On the \(\forall \exists \)-theories of free projective planes
• First-order model theory of free projective planes
• Freely generated projective planes with finite computable dimension
• ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS
• ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS

This page was built for publication: Systems of Diophantine equations over finite configurations