Pages that link to "Item:Q1156188"
From MaRDI portal
The following pages link to Generalized galois theory and its application to complexity (Q1156188):
Displaying 4 items.
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- Some elements of a Galois theory of the structure and complexity of the tree automorphism problem (Q1155358) (← links)
- Definability by programs in first-order structures (Q1171876) (← links)
- Maximizing a lower bound on the computational complexity (Q1838037) (← links)
