Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling (Q5232759): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3210187043 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1805.01310 / rank | |||
Normal rank | |||
Latest revision as of 01:10, 20 April 2024
scientific article; zbMATH DE number 7104645
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling |
scientific article; zbMATH DE number 7104645 |
Statements
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling (English)
0 references
13 September 2019
0 references
