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 1304836

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

zbMATH Open0947.90032MaRDI QIDQ4251685FDOQ4251685


Authors: Andreas Behr, L. Camarinopoulos Edit this on Wikidata


Publication date: 8 November 2000



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



Recommendations

  • Reliable assignments of processors to tasks and factoring on matroids
  • Computational Complexity of Coherent Systems and the Reliability Polynomial
  • Oriented matroid systems
  • Publication:5749141


zbMATH Keywords

matroidsdomination theorycoherent binary systemstotal amenability


Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)



Cited In (3)

  • Title not available (Why is that?)
  • Oriented matroid systems
  • Reliable assignments of processors to tasks and factoring on matroids





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

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