Maximizing a lower bound on the computational complexity

DOI10.1016/0166-218X(82)90037-3zbMath0508.68027MaRDI QIDQ1838037

Georg Gati

Publication date: 1982

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

generalized Galois theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Separable extensions, Galois theory (12F10)

Cites Work

• Some elements of a Galois theory of the structure and complexity of the tree automorphism problem
• Generalized galois theory and its application to complexity
• Introduction to model theory and to the metamathematics of algebra
• Unnamed Item

This page was built for publication: Maximizing a lower bound on the computational complexity