Detecting embedded Horn structure in propositional logic (Q1198035): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Recognizing disguised NR(1) instances of the satisfiability problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exact algorithm for the maximum clique problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On renamable Horn and generalized Horn functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3798257 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank | |||
Normal rank | |||
Revision as of 14:35, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Detecting embedded Horn structure in propositional logic |
scientific article |
Statements
Detecting embedded Horn structure in propositional logic (English)
0 references
16 January 1993
0 references
set packing problem
0 references
maximum renamable Horn problem
0 references
propositional satisfiability problem
0 references
NP-hard
0 references
maximum clique problem
0 references
