Automated proofs of upper bounds on the running time of splitting algorithms (Q5311517)
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 2197527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automated proofs of upper bounds on the running time of splitting algorithms |
scientific article; zbMATH DE number 2197527 |
Statements
Parameterized and Exact Computation (English)
0 references
Automated proofs of upper bounds on the running time of splitting algorithms (English)
0 references
23 August 2005
0 references
0.8637978
0 references
0.86139184
0 references
0.8585105
0 references
0 references
0.84929955
0 references