Computational complexity of queries based on itemsets (Q844194): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1902.00633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Support for Data Mining Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatization of frequent itemsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Itemset frequency satisfiability: complexity and axiomatization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of probabilistic inference using Bayesian belief networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: I-divergence geometry of probability distributions and minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Possible Inequalities for the Probability of a Logical Function of Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5529067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic logic programming with conditional constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank

Latest revision as of 10:00, 2 July 2024

scientific article
Language Label Description Also known as
English
Computational complexity of queries based on itemsets
scientific article

    Statements