On the query complexity of selecting minimal sets for monotone predicates (Q253999): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/ai/JanotaM16, #quickstatements; #temporary_batch_1731530891435 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ai/JanotaM16 / rank | |||
Normal rank | |||
Latest revision as of 21:48, 13 November 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
