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

scientific article

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

zbMATH Open0755.68042MaRDI QIDQ4016522

Alois Peter Heinz

Publication date: 16 January 1993



Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


zbMATH Keywords

tableauxrelational databaserelational algebraquery optimization


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)




Recommendations

  • Unnamed Item ๐Ÿ‘ ๐Ÿ‘Ž
  • Unnamed Item ๐Ÿ‘ ๐Ÿ‘Ž
  • Complexity results on the conjugacy problem for monoids ๐Ÿ‘ ๐Ÿ‘Ž
  • A polynomial time algorithm to compute the Abelian kernel of a finite monoid ๐Ÿ‘ ๐Ÿ‘Ž
  • An analogue of the plactic monoid for binary search trees ๐Ÿ‘ ๐Ÿ‘Ž
  • Algorithmic properties of inverse monoids with hyperbolic and tree-like Schรผtzenberger graphs ๐Ÿ‘ ๐Ÿ‘Ž
  • A Tale of Two Monoids: A Friendly Introduction to Nonunique Factorizations ๐Ÿ‘ ๐Ÿ‘Ž
  • On dynamic algorithms for factorization invariants in numerical monoids ๐Ÿ‘ ๐Ÿ‘Ž
  • On tree factorizations of Kn ๐Ÿ‘ ๐Ÿ‘Ž
  • Factorization in monoids by stratification of atoms and the Elliott problem ๐Ÿ‘ ๐Ÿ‘Ž





This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4016522&oldid=17718227"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 02:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki