On the query complexity of selecting minimal sets for monotone predicates (Q253999)
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: On the query complexity of selecting minimal sets for monotone predicates |
scientific article; zbMATH DE number 6551561
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the query complexity of selecting minimal sets for monotone predicates |
scientific article; zbMATH DE number 6551561 |
Statements
On the query complexity of selecting minimal sets for monotone predicates (English)
0 references
8 March 2016
0 references
query complexity
0 references
monotone predicates
0 references
minimal set
0 references
SAT
0 references
backbone
0 references
minimal unsatisfiable set
0 references
minimal correction set
0 references
independent variables
0 references
