Klam value
http://dbpedia.org/resource/Klam_value
In the parameterized complexity of algorithms, the klam value of a parameterized algorithm is a number that bounds the parameter values for which the algorithm might reasonably be expected to be practical. An algorithm with a higher klam value can be used for a wider range of parameter values than another algorithm with a lower klam value. The klam value was first defined by Downey and Fellows, and has since been used by other researchers in parameterized complexity both as a way of comparing different algorithms to each other and in order to set goals for future algorithmic improvements.
rdf:langString
rdf:langString
Klam value
xsd:integer
45518322
xsd:integer
1089207038
rdf:langString
Downey
rdf:langString
Fellows
xsd:integer
1999
rdf:langString
In the parameterized complexity of algorithms, the klam value of a parameterized algorithm is a number that bounds the parameter values for which the algorithm might reasonably be expected to be practical. An algorithm with a higher klam value can be used for a wider range of parameter values than another algorithm with a lower klam value. The klam value was first defined by Downey and Fellows, and has since been used by other researchers in parameterized complexity both as a way of comparing different algorithms to each other and in order to set goals for future algorithmic improvements.
rdf:langString
Rod Downey
rdf:langString
Michael Fellows
xsd:nonNegativeInteger
6457