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

On complexity of reliable probabilistic networks

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

zbMath0958.68127MaRDI QIDQ1841316

A. M. Koptev

Publication date: 25 February 2001

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)


zbMATH Keywords

complexityprobabilistic networks


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)








This page was built for publication: On complexity of reliable probabilistic networks

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