Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
DOI10.1016/S0166-218X(02)00300-1zbMATH Open0902.05052MaRDI QIDQ4220199FDOQ4220199
Authors: Alexandre A. Makhnev, Dmitriĭ Viktorovich Paduchikh
Publication date: 22 November 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Association schemes, strongly regular graphs (05E30) Generalized quadrangles and generalized polygons in finite geometry (51E12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finitely generated distribution algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the generation of rational numbers by probabilistic contact nets
Cited In (5)
This page was built for publication: Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4220199)