No Efficient Disjunction or Conjunction of Switch-Lists (Q5080958): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Recognition of tractable DNFs representable by a constant number of intervals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Properties of Switch-List Representations of Boolean Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4411139 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Disjunctive closures for knowledge compilation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing the minimum DNF representation of Boolean functions defined by intervals / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4224882663 / rank | |||
Normal rank |
Latest revision as of 10:48, 30 July 2024
scientific article; zbMATH DE number 7535442
Language | Label | Description | Also known as |
---|---|---|---|
English | No Efficient Disjunction or Conjunction of Switch-Lists |
scientific article; zbMATH DE number 7535442 |
Statements
No Efficient Disjunction or Conjunction of Switch-Lists (English)
0 references
1 June 2022
0 references
switch-lists
0 references
knowledge compilation
0 references