Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3552492

From MaRDI portal
Publication:4126324
Jump to:navigation, search

zbMATH Open0355.02027MaRDI QIDQ4126324FDOQ4126324


Authors: Erwin Engeler Edit this on Wikidata


Publication date: 1976



Title of this publication is not available (Why is that?)




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
  • Some elements of a Galois theory of the structure and complexity of the tree automorphism problem
  • Maximizing a lower bound on the computational complexity
  • 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4126324&oldid=17912714"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 08:42. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki