scientific article; zbMATH DE number 3552492

MaRDI QIDQ4126324zbMATH OpenFDO

Authors Erwin Engeler

Publication date 1976

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Proof theory and constructive mathematics (03F99)

Cited in

(4)

• The algebraic degree of geometric optimization problems
• Maximizing a lower bound on the computational complexity
• Some elements of a Galois theory of the structure and complexity of the tree automorphism problem
• Generalized galois theory and its application to complexity

This page was built for publication:

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