Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Average-case complexity for the execution of recursive definitions on relational databases (paper no 50-95 accepted for publication in ACTA INFORMATICA)

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

DOI10.1007/s002360050119zbMath0898.68021OpenAlexW2024436296MaRDI QIDQ1386412

Vangelis Th. Paschos, Andreas N. Stafylopatis, Wenceslas Fernandez de la Vega

Publication date: 10 August 1998

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050119

zbMATH Keywords

database queries


Mathematics Subject Classification ID

Database theory (68P15)





Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1386412&oldid=13544753"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki