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 2032365

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

zbMATH Open1041.68027MaRDI QIDQ4446211FDOQ4446211


Authors: El'yar E. Gasanov Edit this on Wikidata


Publication date: 26 January 2004



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



Recommendations

  • Solution of the problem of the optimal synthesis of information graphs for basic information search problems.
  • scientific article; zbMATH DE number 1988012
  • Information storage and search complexity theory
  • scientific article; zbMATH DE number 1889083
  • scientific article; zbMATH DE number 2183547


zbMATH Keywords

data modelinterval searchinclusive search


Mathematics Subject Classification ID

Database theory (68P15)



Cited In (6)

  • Title not available (Why is that?)
  • Information storage and search complexity theory
  • Title not available (Why is that?)
  • Methods of increasing the efficiency and quality of structures of thematic patent databases in patent automated information control systems
  • Title not available (Why is that?)
  • Solution of the problem of the optimal synthesis of information graphs for basic information search problems.





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 Q4446211)

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