Automorphisms of the lattice of recursively enumerable sets / Peter Cholak
| Automorphisms of the lattice of recursively enumerable sets / Peter Cholak |
| Autore | Cholak, Peter |
| Pubbl/distr/stampa | Providence, : American mathematical society, 1995 |
| Descrizione fisica | VII, 151 p. ; 26 cm. |
| Soggetto topico | 03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] |
| ISBN | 08-218-2601-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0054702 |
Cholak, Peter
|
||
| Providence, : American mathematical society, 1995 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Automorphisms of the lattice of recursively enumerable sets / Peter Cholak
| Automorphisms of the lattice of recursively enumerable sets / Peter Cholak |
| Autore | Cholak, Peter |
| Pubbl/distr/stampa | Providence, : American mathematical society, 1995 |
| Descrizione fisica | VII, 151 p. ; 26 cm |
| Soggetto topico | 03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] |
| ISBN | 08-218-2601-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0054702 |
Cholak, Peter
|
||
| Providence, : American mathematical society, 1995 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Automorphisms of the lattice of recursively enumerable sets / Peter Cholak
| Automorphisms of the lattice of recursively enumerable sets / Peter Cholak |
| Autore | Cholak, Peter |
| Pubbl/distr/stampa | Providence, : American mathematical society, 1995 |
| Descrizione fisica | VII, 151 p. ; 26 cm |
| Soggetto topico | 03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] |
| ISBN | 08-218-2601-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00054702 |
Cholak, Peter
|
||
| Providence, : American mathematical society, 1995 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
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 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computability, enumerability, unsolvability : directions in recursion theory / edited by S. B. Cooper, T. A. Slaman, S. S. Wainer
| Computability, enumerability, unsolvability : directions in recursion theory / edited by S. B. Cooper, T. A. Slaman, S. S. Wainer |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 1996 |
| Descrizione fisica | VII, 347 p. ; 24 cm. |
| Soggetto topico |
03D30 - Other degrees and reducibilities in computability and recursion theory [MSC 2020]
03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] |
| ISBN |
05-215-5736-4
978-05-215-5736-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0054913 |
| Cambridge, : Cambridge university, 1996 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computability, enumerability, unsolvability : directions in recursion theory / edited by S. B. Cooper, T. A. Slaman, S. S. Wainer
| Computability, enumerability, unsolvability : directions in recursion theory / edited by S. B. Cooper, T. A. Slaman, S. S. Wainer |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 1996 |
| Descrizione fisica | VII, 347 p. ; 24 cm |
| Soggetto topico |
03D30 - Other degrees and reducibilities in computability and recursion theory [MSC 2020]
03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] |
| ISBN |
05-215-5736-4
978-05-215-5736-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0054913 |
| Cambridge, : Cambridge university, 1996 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computability, enumerability, unsolvability : directions in recursion theory / edited by S. B. Cooper, T. A. Slaman, S. S. Wainer
| Computability, enumerability, unsolvability : directions in recursion theory / edited by S. B. Cooper, T. A. Slaman, S. S. Wainer |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 1996 |
| Descrizione fisica | VII, 347 p. ; 24 cm |
| Soggetto topico |
03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020]
03D30 - Other degrees and reducibilities in computability and recursion theory [MSC 2020] |
| ISBN |
05-215-5736-4
978-05-215-5736-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00054913 |
| Cambridge, : Cambridge university, 1996 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computation, cryptography, and network security / Nicholas J. Daras, Michael Th. Rassias editors
| Computation, cryptography, and network security / Nicholas J. Daras, Michael Th. Rassias editors |
| Pubbl/distr/stampa | [Cham], : Springer, 2015 |
| Descrizione fisica | IX, 756 p. : ill. ; 24 cm |
| Soggetto topico |
26D15 - Inequalities for sums, series and integrals [MSC 2020]
44A10 - Laplace transform [MSC 2020] 45Pxx - Integral operators [MSC 2020] 94C30 - Applications of design theory to circuits and networks [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] 03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] 46E30 - Spaces of measurable functions (Lp-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc) [MSC 2020] 47G10 - Integral operators [MSC 2020] 31A10 - Integral representations, integral operators, integral equations methods in two dimensions [MSC 2020] 11U05 - Decidability (number-theoretic aspects) [MSC 2020] 47A07 - Forms (bilinear, sesquilinear, multilinear) [MSC 2020] 91B26 - Auctions, bargaining, bidding and selling, and other market models [MSC 2020] |
| Soggetto non controllato |
Biometrics
Computer security Cryptanalysis Cryptosystems Elliptic curves Quantum Cryptography |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0113538 |
| [Cham], : Springer, 2015 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computation, cryptography, and network security / Nicholas J. Daras, Michael Th. Rassias editors
| Computation, cryptography, and network security / Nicholas J. Daras, Michael Th. Rassias editors |
| Pubbl/distr/stampa | [Cham], : Springer, 2015 |
| Descrizione fisica | IX, 756 p. : ill. ; 24 cm |
| Soggetto topico |
03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020]
11U05 - Decidability (number-theoretic aspects) [MSC 2020] 26D15 - Inequalities for sums, series and integrals [MSC 2020] 31A10 - Integral representations, integral operators, integral equations methods in two dimensions [MSC 2020] 44A10 - Laplace transform [MSC 2020] 45Pxx - Integral operators [MSC 2020] 46E30 - Spaces of measurable functions (Lp-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc) [MSC 2020] 47A07 - Forms (bilinear, sesquilinear, multilinear) [MSC 2020] 47G10 - Integral operators [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] 91B26 - Auctions, bargaining, bidding and selling, and other market models [MSC 2020] 94C30 - Applications of design theory to circuits and networks [MSC 2020] |
| Soggetto non controllato |
Biometrics
Computer security Cryptanalysis Cryptosystems Elliptic curves Quantum Cryptography |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00113538 |
| [Cham], : Springer, 2015 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computation, cryptography, and network security / Nicholas J. Daras, Michael Th. Rassias editors
| Computation, cryptography, and network security / Nicholas J. Daras, Michael Th. Rassias editors |
| Edizione | [[Cham] : Springer, 2015] |
| Pubbl/distr/stampa | IX, 756 p., : ill. ; 24 cm |
| Descrizione fisica | Pubblicazione in formato elettronico |
| Soggetto topico |
26D15 - Inequalities for sums, series and integrals [MSC 2020]
44A10 - Laplace transform [MSC 2020] 45Pxx - Integral operators [MSC 2020] 94C30 - Applications of design theory to circuits and networks [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] 03D25 - Recursively (computably) enumerable sets and degrees [MSC 2020] 46E30 - Spaces of measurable functions (Lp-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc) [MSC 2020] 47G10 - Integral operators [MSC 2020] 31A10 - Integral representations, integral operators, integral equations methods in two dimensions [MSC 2020] 11U05 - Decidability (number-theoretic aspects) [MSC 2020] 47A07 - Forms (bilinear, sesquilinear, multilinear) [MSC 2020] 91B26 - Auctions, bargaining, bidding and selling, and other market models [MSC 2020] |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0113538 |
| IX, 756 p., : ill. ; 24 cm | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||