Definitions for kernelization
ker·nel·iza·tion

WiktionaryRate this definition:0.0 / 0 votes

1. kernelizationnoun

   a technique for creating algorithms for fixed-parameter tractable problems

WikipediaRate this definition:0.0 / 0 votes

1. Kernelization

   In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in which inputs to the algorithm are replaced by a smaller input, called a "kernel". The result of solving the problem on the kernel should either be the same as on the original input, or it should be easy to transform the output on the kernel to the desired output for the original problem. Kernelization is often achieved by applying a set of reduction rules that cut away parts of the instance that are easy to handle. In parameterized complexity theory, it is often possible to prove that a kernel with guaranteed bounds on the size of a kernel (as a function of some parameter associated to the problem) can be found in polynomial time. When this is possible, it results in a fixed-parameter tractable algorithm whose running time is the sum of the (polynomial time) kernelization step and the (non-polynomial but bounded by the parameter) time to solve the kernel. Indeed, every problem that can be solved by a fixed-parameter tractable algorithm can be solved by a kernelization algorithm of this type.

WikidataRate this definition:0.0 / 0 votes

1. Kernelization

   In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in which inputs to the algorithm are replaced by a smaller input, called a "kernel". The result of solving the problem on the kernel should either be the same as on the original input, or it should be easy to transform the output on the kernel to the desired output for the original problem. Kernelization is often achieved by applying a set of reduction rules that cut away parts of the instance that are easy to handle. In parameterized complexity theory, it is often possible to prove that a kernel with guaranteed bounds on the size of a kernel can be found in polynomial time. When this is possible, it results in a fixed-parameter tractable algorithm whose running time is the sum of the kernelization step and the time to solve the kernel. Indeed, every problem that can be solved by a fixed-parameter tractable algorithm can be solved by a kernelization algorithm of this type.

How to pronounce kernelization?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say kernelization in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of kernelization in Chaldean Numerology is: 3

2. Pythagorean Numerology

   The numerical value of kernelization in Pythagorean Numerology is: 6

References

1. ^ Wiktionary
   https://en.wiktionary.org/wiki/Kernelization
2. ^ Wikipedia
   https://en.wikipedia.org/wiki/Kernelization
3. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=kernelization