Complexity and Real Computation
Dis 2012 · Springer Science & Business Media
E-book
453
Mga Page
reportHindi na-verify ang mga rating at review Matuto Pa
Tungkol sa ebook na ito
Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms. Meaningful lower bounds on computational complexity are harder to come by, and are not available for most problems of interest. The dominant approach in complexity theory is to consider algorithms as oper ating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot rep resent real or complex numbers, unless the numbers are rounded to approximate values from a discrete set. A major concern of the theory is the number of com putation steps required to solve a problem, as a function of the length of the input string.
I-rate ang e-book na ito
Ipalaam sa amin ang iyong opinyon.
Impormasyon sa pagbabasa
Mga smartphone at tablet
I-install ang Google Play Books app para sa Android at iPad/iPhone. Awtomatiko itong nagsi-sync sa account mo at nagbibigay-daan sa iyong magbasa online o offline nasaan ka man.
Mga laptop at computer
Maaari kang makinig sa mga audiobook na binili sa Google Play gamit ang web browser ng iyong computer.
Mga eReader at iba pang mga device
Para magbasa tungkol sa mga e-ink device gaya ng mga Kobo eReader, kakailanganin mong mag-download ng file at ilipat ito sa iyong device. Sundin ang mga detalyadong tagubilin sa Help Center para mailipat ang mga file sa mga sinusuportahang eReader.
