Minimal unsatisfiability and minimal strongly connected digraphs (Q1656590)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6916315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal unsatisfiability and minimal strongly connected digraphs |
scientific article; zbMATH DE number 6916315 |
Statements
Minimal unsatisfiability and minimal strongly connected digraphs (English)
0 references
10 August 2018
0 references
0.8047570586204529
0 references
0.7991420030593872
0 references
0.7955978512763977
0 references
0.7939186096191406
0 references
0.7936596870422363
0 references
