scientific article; zbMATH DE number 3591972
From MaRDI portal
Publication:4159038
Cited in
(6)- Comparing complexity classes
- On the complexity of inference about probabilistic relational models
- Lower complexity bounds for lifted inference
- Investigation of binary spectra by explicit polynomial transformations of graphs
- Probabilities on Models of Universal Sentences
- Sets of Formulas Valid in Finite Structures
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 Q4159038)