On the query complexity of selecting minimal sets for monotone predicates (Q253999): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q62047278, #quickstatements; #temporary_batch_1712272666262 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62047278 / rank | |||
Normal rank | |||
Revision as of 00:18, 5 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the query complexity of selecting minimal sets for monotone predicates |
scientific article |
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
