On the complexity of algorithms for detecting \(k\)-length negative cost cycles (Q2051903)
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: On the complexity of algorithms for detecting \(k\)-length negative cost cycles |
scientific article; zbMATH DE number 7433394
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of algorithms for detecting \(k\)-length negative cost cycles |
scientific article; zbMATH DE number 7433394 |
Statements
On the complexity of algorithms for detecting \(k\)-length negative cost cycles (English)
0 references
25 November 2021
0 references
\(k\)-length negative cost cycle
0 references
\(\mathcal{NP}\)-complete
0 references
3 occurrence 3-satisfiability
0 references
3-satisfiability
0 references
randomized algorithm
0 references
0 references
0 references
0 references
0.9938971
0 references
0.9209653
0 references
0.9159542
0 references
0 references
0.8838694
0 references
0.88173413
0 references
0 references
0.8667785
0 references
0.86595225
0 references
