Systems of Diophantine equations over finite configurations

DOI10.1134/S0037446623020076MaRDI QIDQ2691809zbMATH OpenOpenAlexFDO

Authors 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

computational complexityconfigurationincidencesystem of equations

Mathematics Subject Classification ID

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

Cites work

• Algebraic geometry over algebraic structures. II: Foundations
• ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS
• First-order model theory of free projective planes
• Freely generated projective planes with finite computable dimension
• scientific article; zbMATH DE number 3421490 (Why is no real title available?)
• Introduction to algorithms
• On complexity of the satisfiability problem of systems over finite posets
• On the -theories of free projective planes

Cited in

(8)

• Multidimensional system of Diophantine equations
• Fundamental systems of \(S\)-units with small height and their applications to Diophantine equations
• Systems of equations for van der Waerden numbers
• The Diophantine problem for systems of algebraic equations with exponents
• The NP-completeness of the consistency problem for systems of Diophantine equations over finite configurations
• The length of an unsatisfiable subformula
• Finite congruence-distributive P.O. systems
• Some diophantine systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2691809)