On complexity of solving of equations over graphs

DOI10.33048/SEMI.2024.21.005MaRDI QIDQ6643490zbMATH OpenFDO

Authors Alexander Rybalov

Publication date 26 November 2024

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/SEMI.2024.21.005

zbMATH Keywords

equationsgeneric complexitygraphsNP-completeness

Mathematics Subject Classification ID

Connections of number theory and logic (11U99)

Recommendations

• ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS
• The complexity of solving equations over finite groups
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• scientific article; zbMATH DE number 1834675
• Mathematical Foundations of Computer Science 2004

Cited in

(3)

• ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS
• On systems of equations defining infinite graphs
• On generic complexity of equation solving over the bicyclic monoid

This page was built for publication: On complexity of solving of equations over graphs

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