A linear time equivalence test for read-twice DNF formulas (Q1334630): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4230377 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic Structures with Hard Equivalence and Minimization Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence of free Boolean graphs can be decided probabilistically in polynomial time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4160379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3742714 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Read-twice DNF formulas are properly learnable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theory of the learnable / rank | |||
Normal rank |
Latest revision as of 17:59, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linear time equivalence test for read-twice DNF formulas |
scientific article |
Statements
A linear time equivalence test for read-twice DNF formulas (English)
0 references
25 September 1994
0 references