Generalized galois theory and its application to complexity

DOI10.1016/S0304-3975(81)80002-3zbMath0468.12014OpenAlexW2013515969MaRDI QIDQ1156188

Erwin Engeler

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(81)80002-3

zbMATH Keywords

Galois group of polynomialfirst-order model theorysolution strategies for algorithmic problemsolvability of polynomial equations

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Equations in general fields (12E12) Algorithms in computer science (68W99)

Related Items (4)

Some elements of a Galois theory of the structure and complexity of the tree automorphism problem ⋮ Definability by programs in first-order structures ⋮ Maximizing a lower bound on the computational complexity ⋮ Necessary and sufficient conditions for the universality of programming formalisms

Cites Work

• Some elements of a Galois theory of the structure and complexity of the tree automorphism problem
• On the metamathematics of algebra
• Syntactic characterisations of amalgamation, convexity and related properties
• Algebraic Extensions of Relational Systems.
• Sur l'extension aux relations de quelques propriétés des ordres
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized galois theory and its application to complexity