On the query complexity of selecting minimal sets for monotone predicates (Q253999): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.artint.2016.01.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2222364239 / rank | |||
Normal rank | |||
Revision as of 01:17, 20 March 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
