ON GENERIC COMPLEXITY OF THE EXISTENTIAL THEORIES

DOI10.17223/20710410/49/9zbMath1477.03159OpenAlexW3088173288MaRDI QIDQ5151458

Alexander N. Rybalov

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm718

zbMATH Keywords

existential theorygeneric complexityfinite algebraic structure

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic geometry over algebraic structures. III: Equationally Noetherian property and compactness
• Generic-case complexity, decision problems in group theory, and random walks.
• ON GENERIC COMPLEXITY OF THE VALIDITY PROBLEM FOR BOOLEAN FORMULAS

This page was built for publication: ON GENERIC COMPLEXITY OF THE EXISTENTIAL THEORIES