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; zbMATH DE number 5242380

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

zbMATH Open1161.68412MaRDI QIDQ5445410

Yu. B. Nikitin

Publication date: 5 March 2008



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



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Searching and sorting (68P10)




Recommendations

  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Some optimal algorithms for decomposed partially ordered sets πŸ‘ πŸ‘Ž
  • Extracting maximal information about sets of minimum cuts πŸ‘ πŸ‘Ž
  • On the complexity of partial order properties πŸ‘ πŸ‘Ž
  • On partial order characterizations of information structures πŸ‘ πŸ‘Ž
  • A lower bound for the complexity of information networks for one partial order relation πŸ‘ πŸ‘Ž





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

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