Contatto
Come acquistare
Consegna
Guida all'acquisto
Feasible Computations and Provable Complexity Properties
Inglese
100 b
Fino a 30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
19.39
€
/
In brossura
37.29
€
/
In brossura
43.59
€
/
In brossura
16.89
€
/
In brossura
46.59
€
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.
Informazioni sul libro
Inglese
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
29.69
€
/
In brossura
38.69
€
