Computational complexity of the negative decision number of graphs (Q2906856)
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: Computational complexity of the negative decision number of graphs |
scientific article; zbMATH DE number 6077846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the negative decision number of graphs |
scientific article; zbMATH DE number 6077846 |
Statements
5 September 2012
0 references
negative votes
0 references
bad function
0 references
Computational complexity of the negative decision number of graphs (English)
0 references
0.8195551037788391
0 references
0.8170549273490906
0 references
0.8084105253219604
0 references
0.7839060425758362
0 references
0.7749542593955994
0 references
