Unique satisfiability of Horn sets can be solved in nearly linear time (Q1894352)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unique satisfiability of Horn sets can be solved in nearly linear time |
scientific article; zbMATH DE number 777815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unique satisfiability of Horn sets can be solved in nearly linear time |
scientific article; zbMATH DE number 777815 |
Statements
Unique satisfiability of Horn sets can be solved in nearly linear time (English)
0 references
6 September 1995
0 references
Horn clauses
0 references
Horn set
0 references
0 references
0.8933004140853882
0 references
0.8933004140853882
0 references
0.8247022032737732
0 references
0.8239602446556091
0 references
0.7916796803474426
0 references
