<p><p>Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than ot
β¦ LIBER β¦
π
Gautschi Algorithm 471, exponential integrals
- Tongue
- English
- Leaves
- 3
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Exact Exponential Algorithms
β Fedor V. Fomin, Dieter Kratsch
π Library
π
2010
π Springer
π English
Exact Exponential Algorithms
β Dieter Kratsch; Fedor V. Fomin
π Library
π
2010
π Springer
π German
Exact Exponential Algorithms
β Fomin, Fedor V. (author);Kratsch, Dieter (author)
π Library
π
2010
π Springer Berlin Heidelberg
π English
Computing exponential integrals
β Amos.
π Library
π English
Exponentially Convergent Algorithms for
β Ivan Gavrilyuk, Volodymyr Makarov, Vitalii Vasylyk (auth.)
π Library
π
2011
π BirkhΓ€user Basel
π English
<p><p>This book presents new accurate and efficient exponentially convergent methods for abstract differential equations with unbounded operator coefficients in Banach space. These methods are highly relevant for practical scientific computing since the equations under consideration can be seen as t
Exponentially Convergent Algorithms for
β Ivan Gavrilyuk, Volodymyr Makarov, Vitalii Vasylyk (auth.)
π Library
π
2011
π BirkhΓ€user Basel
π English
<p><p>This book presents new accurate and efficient exponentially convergent methods for abstract differential equations with unbounded operator coefficients in Banach space. These methods are highly relevant for practical scientific computing since the equations under consideration can be seen as t