Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Bounded Queries in Recursion Theory / William I. Gasarch, Georgia A. Martin
| Bounded Queries in Recursion Theory / William I. Gasarch, Georgia A. Martin |
| Autore | Gasarch, William I. |
| Pubbl/distr/stampa | New York, : Springer ; Boston, : Birkhäuser, 1999 |
| Descrizione fisica | xiii, 353 p. ; 24 cm |
| Altri autori (Persone) | Martin, Georgia A. |
| Soggetto topico |
03-XX - Mathematical logic and foundations [MSC 2020]
03D10 - Turing machines and related notions [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| Soggetto non controllato |
Algorithms
Complexity Computability theory Computer Science Computers Notation Simulation |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00298858 |
Gasarch, William I.
|
||
| New York, : Springer ; Boston, : Birkhäuser, 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
The Computational Complexity of Logical Theories / J. Ferrante, C. W. Rackoff
| The Computational Complexity of Logical Theories / J. Ferrante, C. W. Rackoff |
| Autore | Ferrante, Jeanne |
| Pubbl/distr/stampa | Berlin, : Springer, 1979 |
| Descrizione fisica | xii, 244 p. ; 24 cm |
| Altri autori (Persone) | Rackoff, Charles W. |
| Soggetto topico |
03-XX - Mathematical logic and foundations [MSC 2020]
03D15 - Complexity of computation [MSC 2020] 03B25 - Decidability of theories and sets of sentences [MSC 2020] 03D10 - Turing machines and related notions [MSC 2020] |
| Soggetto non controllato |
Addition
Complexity Computation Computational complexity Functions Games Logic Predicate calculus Shapes |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0261469 |
|
Ferrante, Jeanne
|
||
| Berlin, : Springer, 1979 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
The Computational Complexity of Logical Theories / J. Ferrante, C. W. Rackoff
| The Computational Complexity of Logical Theories / J. Ferrante, C. W. Rackoff |
| Autore | Ferrante, Jeanne |
| Pubbl/distr/stampa | Berlin, : Springer, 1979 |
| Descrizione fisica | xii, 244 p. ; 24 cm |
| Altri autori (Persone) | Rackoff, Charles W. |
| Soggetto topico |
03-XX - Mathematical logic and foundations [MSC 2020]
03B25 - Decidability of theories and sets of sentences [MSC 2020] 03D10 - Turing machines and related notions [MSC 2020] 03D15 - Complexity of computation [MSC 2020] |
| Soggetto non controllato |
Addition
Complexity Computation Computational complexity Functions Games Logic Predicate calculus Shapes |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00261469 |
|
Ferrante, Jeanne
|
||
| Berlin, : Springer, 1979 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Soggetto topico
- 03-XX - Mathematical logic and foundations [MSC 2020] (3)
-
03D10 - Turing machines and related notions [MSC 2020]
(3)
- 03D15 - Complexity of computation [MSC 2020] (3)
- 03B25 - Decidability of theories and sets of sentences [MSC 2020] (2)
- 03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] (1)