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.
Advances in Discrete Applied Mathematics and Graph Theory
| Advances in Discrete Applied Mathematics and Graph Theory |
| Autore | Žerovnik Janez |
| Pubbl/distr/stampa | Basel, : MDPI - Multidisciplinary Digital Publishing Institute, 2022 |
| Descrizione fisica | 1 electronic resource (160 p.) |
| Soggetto topico |
Research & information: general
Mathematics & science |
| Soggetto non controllato |
dominating set
total roman {3}-domination NP-complete linear-time algorithm Ramsey numbers multipartite Ramsey numbers stripes paths cycle ABC index generalizedABC index general Randić index topological indices converse Hölder inequality local antimagic labeling local antimagic chromatic number copies of graphs hyperspace graph dendroid dendrite (inclusive) distance vertex irregular labeling local (inclusive) distance vertex irregular labeling quasi-total Roman domination total Roman domination Roman domination double Roman domination generalized Petersen graph discharging method graph cover double Roman graph topological index vertex degree Sombor index cactus quasi-unicyclic graph bipartite Ramsey numbers Zarankiewicz number total coloring dumbbell maximal planar graphs I-dumbbell maximal planar graphs dumbbell transformation total coloring algorithm domination coloring domination chromatic number split graphs generalized Petersen graphs corona products edge corona products |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910580203603321 |
Žerovnik Janez
|
||
| Basel, : MDPI - Multidisciplinary Digital Publishing Institute, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow
| The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow |
| Autore | Fortnow Lance <1963-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, 2013 |
| Descrizione fisica | 1 online resource (189 p.) |
| Disciplina | 511.3/52 |
| Soggetto topico |
NP-complete problems
Computer algorithms |
| Soggetto non controllato |
Facebook
Frenemy Hamiltonian paths Internet Ketan Mulmuley Leonid Levin Martin Hellman NP problem NP problems NP-complete problems NP-complete P versus NP problem P versus NP Richard Feynman Steve Cook Urbana algorithm Whitfield Diffie academic work algebraic geometry algorithm algorithms approximation big data computational problems computer science computers computing cryptography cryptosystem database decryption digital computers efficient algorithms efficient computation encryption factoring fast computers graph isomorphism heuristics linear programming mathematics max-cut network security networking new technologies parallel computation perebor prime numbers problems programming public-key cryptography quantum computers quantum computing quantum cryptography quantum mechanics quantum physical systems research community secret messages social networking data solution teleportation |
| ISBN |
1-4008-4661-7
1-299-15656-8 |
| Classificazione | COM051300MAT015000MAT017000MAT034000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index |
| Record Nr. | UNINA-9910779319903321 |
|
Fortnow Lance <1963->
|
||
| Princeton, : Princeton University Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow
| The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow |
| Autore | Fortnow Lance <1963-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, 2013 |
| Descrizione fisica | 1 online resource (189 p.) |
| Disciplina | 511.3/52 |
| Soggetto topico |
NP-complete problems
Computer algorithms |
| Soggetto non controllato |
Facebook
Frenemy Hamiltonian paths Internet Ketan Mulmuley Leonid Levin Martin Hellman NP problem NP problems NP-complete problems NP-complete P versus NP problem P versus NP Richard Feynman Steve Cook Urbana algorithm Whitfield Diffie academic work algebraic geometry algorithm algorithms approximation big data computational problems computer science computers computing cryptography cryptosystem database decryption digital computers efficient algorithms efficient computation encryption factoring fast computers graph isomorphism heuristics linear programming mathematics max-cut network security networking new technologies parallel computation perebor prime numbers problems programming public-key cryptography quantum computers quantum computing quantum cryptography quantum mechanics quantum physical systems research community secret messages social networking data solution teleportation |
| ISBN |
1-4008-4661-7
1-299-15656-8 |
| Classificazione | COM051300MAT015000MAT017000MAT034000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index |
| Record Nr. | UNINA-9910818849503321 |
|
Fortnow Lance <1963->
|
||
| Princeton, : Princeton University Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
In Memoriam, Solomon Marcus
| In Memoriam, Solomon Marcus |
| Autore | Calude Cristian S |
| Pubbl/distr/stampa | Basel, : MDPI - Multidisciplinary Digital Publishing Institute, 2022 |
| Descrizione fisica | 1 electronic resource (148 p.) |
| Soggetto topico |
Information technology industries
Computer science |
| Soggetto non controllato |
automata theory
formal language theory bio-informatics recursive function theory evolutionary processor network of evolutionary processors network topology theory of computation computational models intrinsic perception Hausdorff dimension fractal computational complexity Turing machine oracle Turing machine shortest computations quasiperiod formal language asymptotic growth polynomial membrane computing computational complexity theory P vs. NP problem evolutional communication symport/antiport Kolmogorov complexity random strings extractors finite languages deterministic finite cover automata multiple entry automata automata with “do not care” symbols similarity relations process calculus communication patterns control structures hypergraph model P systems cP systems NP-complete NP-hard SAT logarithmic time complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910566467603321 |
|
Calude Cristian S
|
||
| Basel, : MDPI - Multidisciplinary Digital Publishing Institute, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Networks, Communication, and Computing Vol. 2
| Networks, Communication, and Computing Vol. 2 |
| Autore | Farago Andras |
| Pubbl/distr/stampa | Basel, Switzerland, : MDPI - Multidisciplinary Digital Publishing Institute, 2021 |
| Descrizione fisica | 1 electronic resource (108 p.) |
| Soggetto topico | Information technology industries |
| Soggetto non controllato |
communication traffic prediction
intelligent traffic management deformable convolution attention mechanism the next generation of telecommunication (5G) deep learning reinforcement learning systematic review cellular networks underwater wireless sensor networks ant colony optimization algorithms clustering routing algorithms energy efficiency network lifetime unmanned aerial vehicles UAV placement metaheuristics routing NP-complete NP-hard approximation polynomial time algorithm disjoint connecting paths unsplittable flow network design |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910557337803321 |
|
Farago Andras
|
||
| Basel, Switzerland, : MDPI - Multidisciplinary Digital Publishing Institute, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||