Counting Complexity of Minimal Cardinality and Minimal Weight Abduction (Q3532468): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Subtractive reductions and complete problems for counting complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logic-based abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Counting the Optimal Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Opt P to the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Horn abduction and Bayesian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 19:10, 28 June 2024

scientific article
Language Label Description Also known as
English
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
scientific article

    Statements