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.
Complexity : knots, colourings, and counting / D. J. A. Welsh
| Complexity : knots, colourings, and counting / D. J. A. Welsh |
| Autore | Welsh, Dominic J. A. |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 1993 |
| Descrizione fisica | VIII, 163 p. : ill. ; 23 cm. |
| Soggetto topico |
68-XX - Computer science [MSC 2020]
68R05 - Combinatorics in computer science [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 82B43 - Percolation [MSC 2020] 57K10 - Knot theory [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| ISBN | 978-05-214-5740-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0047492 |
Welsh, Dominic J. A.
|
||
| Cambridge, : Cambridge university, 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Complexity : knots, colourings, and counting / D. J. A. Welsh
| Complexity : knots, colourings, and counting / D. J. A. Welsh |
| Autore | Welsh, Dominic J. A. |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 1993 |
| Descrizione fisica | VIII, 163 p. : ill. ; 23 cm |
| Soggetto topico |
68-XX - Computer science [MSC 2020]
68R05 - Combinatorics in computer science [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 82B43 - Percolation [MSC 2020] 57K10 - Knot theory [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| ISBN | 978-05-214-5740-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0047492 |
|
Welsh, Dominic J. A.
|
||
| Cambridge, : Cambridge university, 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Logical foundations of mathematics and computational complexity : a gentle introduction / Pavel Pudlák
| Logical foundations of mathematics and computational complexity : a gentle introduction / Pavel Pudlák |
| Autore | Pudlák, Pavel |
| Pubbl/distr/stampa | Cham, : Springer, 2013 |
| Descrizione fisica | xiv, 695 p. : ill. ; 24 cm |
| Soggetto topico |
03F20 - Complexity of proofs [MSC 2020]
03E35 - Consistency and independence results [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 03F03 - Proof theory, general (including proof-theoretic semantics) [MSC 2020] 03E30 - Axiomatics of classical set theory and its fragments [MSC 2020] 03F30 - First-order arithmetic and fragments [MSC 2020] 03F40 - Gödel numberings and issues of incompleteness [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| Soggetto non controllato |
Algorithm analysis and problem complexity
Algorithmic complexity Complexity of Proofs Computational complexity Foundations of mathematics Incompleteness theorems Mathematical logic Set-Theoretical Foundations |
| ISBN | 978-33-19-00118-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0273604 |
|
Pudlák, Pavel
|
||
| Cham, : Springer, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Open problems in mathematics / John Forbes Nash, Jr., Michael Th. Rassias editors
| Open problems in mathematics / John Forbes Nash, Jr., Michael Th. Rassias editors |
| Pubbl/distr/stampa | [Cham], : Springer, 2016 |
| Descrizione fisica | XIII, 543 p. : ill. ; 24 cm |
| Soggetto topico |
35Q30 - Navier-Stokes equations [MSC 2020]
01A70 - Biographies, obituaries, personalia, bibliographies [MSC 2020] 52C10 - Erdős problems and related topics of discrete geometry [MSC 2020] 00B15 - Collections of articles of miscellaneous specific interest [MSC 2020] 11M26 - Nonreal zeros of $\zeta (s)$ and $L(s, \chi)$; Riemann and other hypotheses [MSC 2020] 11D41 - Higher degree equations; Fermat's equation [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| Soggetto non controllato |
Generalized Fermat equation
Hadwiger's conjecture John Nash Jr. publication Navier-Stokes equations Novikov's conjecture Open problems mathematics Partial differential equations Quantum Systems Riemann hypothesis |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0115127 |
| [Cham], : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Open problems in mathematics / John Forbes Nash, Jr., Michael Th. Rassias editors
| Open problems in mathematics / John Forbes Nash, Jr., Michael Th. Rassias editors |
| Edizione | [[Cham] : Springer, 2016] |
| Pubbl/distr/stampa | XIII, 543 p., : ill. ; 24 cm |
| Descrizione fisica | Pubblicazione in formato elettronico |
| Soggetto topico |
35Q30 - Navier-Stokes equations [MSC 2020]
01A70 - Biographies, obituaries, personalia, bibliographies [MSC 2020] 52C10 - Erdős problems and related topics of discrete geometry [MSC 2020] 00B15 - Collections of articles of miscellaneous specific interest [MSC 2020] 11M26 - Nonreal zeros of $\zeta (s)$ and $L(s, \chi)$; Riemann and other hypotheses [MSC 2020] 11D41 - Higher degree equations; Fermat's equation [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0115127 |
| XIII, 543 p., : ill. ; 24 cm | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Perspectives in computational complexity : the Somenath Biswas anniversary volume / Manindra Agrawal, Vikraman Arvind editors
| Perspectives in computational complexity : the Somenath Biswas anniversary volume / Manindra Agrawal, Vikraman Arvind editors |
| Pubbl/distr/stampa | Cham, : Birkhäuser, : Springer, 2014 |
| Descrizione fisica | X, 202 p. ; 24 cm |
| Soggetto topico |
68-XX - Computer science [MSC 2020]
03-XX - Mathematical logic and foundations [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| Soggetto non controllato |
Arithmetic circuits
Complete sets Information Theory Lower bounds Space and time complexity classes |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0103385 |
| Cham, : Birkhäuser, : Springer, 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Perspectives in computational complexity : the Somenath Biswas anniversary volume / Manindra Agrawal, Vikraman Arvind editors
| Perspectives in computational complexity : the Somenath Biswas anniversary volume / Manindra Agrawal, Vikraman Arvind editors |
| Edizione | [Cham : Birkhäuser : Springer, 2014] |
| Descrizione fisica | Pubblicazione in formato elettronico |
| Soggetto topico |
68-XX - Computer science [MSC 2020]
03-XX - Mathematical logic and foundations [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| ISBN | 8-3-319-05445-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0103385 |
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
|
Proof complexity and feasible arithmetics / edited by Paul W. Beame, Samuel R. Buss
| Proof complexity and feasible arithmetics / edited by Paul W. Beame, Samuel R. Buss |
| Pubbl/distr/stampa | Providence, : American mathematical society, 1998 |
| Descrizione fisica | XII, 320 p. ; 24 cm. |
| Soggetto topico |
68R05 - Combinatorics in computer science [MSC 2020]
03Fxx - Proof theory and constructive mathematics [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| ISBN | 978-08-218-0577-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0054248 |
| Providence, : American mathematical society, 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Proof complexity and feasible arithmetics / edited by Paul W. Beame, Samuel R. Buss
| Proof complexity and feasible arithmetics / edited by Paul W. Beame, Samuel R. Buss |
| Pubbl/distr/stampa | Providence, : American mathematical society, 1998 |
| Descrizione fisica | XII, 320 p. ; 24 cm |
| Soggetto topico |
68R05 - Combinatorics in computer science [MSC 2020]
03Fxx - Proof theory and constructive mathematics [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| ISBN | 978-08-218-0577-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0054248 |
| Providence, : American mathematical society, 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Provability, complexity, grammars / Lev Beklemishev, Mati Pentus, Nikolai Vereshchagin
| Provability, complexity, grammars / Lev Beklemishev, Mati Pentus, Nikolai Vereshchagin |
| Autore | Beklemishev, Lev |
| Pubbl/distr/stampa | Providence, : AMS, 1999 |
| Descrizione fisica | IX, 172 p. ; 26 cm. |
| Altri autori (Persone) |
Vereshchagin, Nikolai K.
Pentus, Mati |
| Soggetto topico |
03F40 - Gödel numberings and issues of incompleteness [MSC 2020]
03B45 - Modal logic (including the logic of norms) [MSC 2020] 03B65 - Logic of natural languages [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] |
| ISBN | 978-08-218-1078-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0052352 |
|
Beklemishev, Lev
|
||
| Providence, : AMS, 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Soggetto topico
-
68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020]
(11)
- 03D15 - Complexity of computation [MSC 2020] (5)
- 68-XX - Computer science [MSC 2020] (4)
- 68R05 - Combinatorics in computer science [MSC 2020] (4)
- 03F40 - Gödel numberings and issues of incompleteness [MSC 2020] (3)