Feasible Computations and Provable Complexity Properties
Juris Hartmanis
jaan 1978 · SIAM
4,0star
2 arvustustreport
E-raamat
69
lehekülge
family_home
Sobilik
info
reportHinnangud ja arvustused pole kinnitatud. Lisateave
Teave selle e-raamatu kohta
An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory.
Hinnangud ja arvustused
4,0
2 arvustust
Hinnake seda e-raamatut
Andke meile teada, mida te arvate.
Lugemisteave
Nutitelefonid ja tahvelarvutid
Installige rakendus Google Play raamatud Androidile ja iPadile/iPhone'ile. See sünkroonitakse automaatselt teie kontoga ja see võimaldab teil asukohast olenemata lugeda nii võrgus kui ka võrguühenduseta.
Sülearvutid ja arvutid
Google Playst ostetud audioraamatuid saab kuulata arvuti veebibrauseris.
E-lugerid ja muud seadmed
E-tindi seadmetes (nt Kobo e-lugerid) lugemiseks peate faili alla laadima ja selle oma seadmesse üle kandma. Failide toetatud e-lugeritesse teisaldamiseks järgige üksikasjalikke abikeskuse juhiseid.
