Generalized galois theory and its application to complexity
From MaRDI portal
Publication:1156188
DOI10.1016/S0304-3975(81)80002-3zbMath0468.12014MaRDI QIDQ1156188
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
Galois group of polynomial; first-order model theory; solution strategies for algorithmic problem; solvability of polynomial equations
12F10: Separable extensions, Galois theory
12E12: Equations in general fields
68W99: Algorithms in computer science
Related Items
Necessary and sufficient conditions for the universality of programming formalisms, 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
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