Achieving new upper bounds for the hypergraph duality problem through logic (Q4635628)
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: Achieving new upper bounds for the hypergraph duality problem through logic |
scientific article; zbMATH DE number 6863101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Achieving new upper bounds for the hypergraph duality problem through logic |
scientific article; zbMATH DE number 6863101 |
Statements
Achieving new upper bounds for the hypergraph duality problem through logic (English)
0 references
23 April 2018
0 references
DNF duality
0 references
\(\mathrm{TC}^0\)
0 references
algorithms
0 references
complexity
0 references
first-order logic
0 references
first-order logic with counting quantifiers
0 references
graph theory
0 references
hypergraph duality
0 references
hypergraph transversals
0 references
hypergraphs
0 references
limited nondeterminism
0 references
logical analysis of algorithms
0 references
1.0000005
0 references
0 references
0 references
0.8632265
0 references
0.86139125
0 references
0 references
