<p>One of the most important and successful theories in computational complexΒ ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational probΒ lems according to their algorithmic difficulty. Turing machines forma
β¦ LIBER β¦
π
Independence in Algebraic Complexity Theory
β Scribed by Johannes Mittmann
- Year
- 2013
- Tongue
- English
- Leaves
- 181
- Series
- Thesis at Rheinische Friedrich-Wilhelms-UniversitΓ€t Bonn
- Edition
- version 13 Mar 2013
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Completeness and Reduction in Algebraic
β Peter BΓΌrgisser (auth.)
π Library
π
2000
π Springer-Verlag Berlin Heidelberg
π English
Introduction to Algebraic Independence T
β Yuri V. Nesterenko, Patrice Philippon (eds.)
π Library
π
2001
π Springer-Verlag Berlin Heidelberg
π English
Introduction to Algebraic Independence T
β Yuri V. Nesterenko (editor), Patrice Philippon (editor)
π Library
π
2001
π Springer
π English
<span>In the last five years there has been very significant progress in the development of transcendence theory. A new approach to the arithmetic properties of values of modular forms and theta-functions was found. The solution of the Mahler-Manin problem on values of modular function j(tau) and al
Algebraic methods in the global theory o
β Banica C., Stanasila O.
π Library
π
1976
π Wiley
π English
Algebraic Methods in the Global Theory o
β Constantin BΔnicΔ, Octavian StΔnΔΕilΔ
π Library
π
1976
π John Wiley & Sons Ltd
π English
Algebraic Methods in the Gobal Theory of
β Banica C., Stanasila O.
π Library
π
1976
π English