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 online resource (160 p.) |
| Soggetto topico |
Mathematics & science
Research & information: general |
| Soggetto non controllato |
(inclusive) distance vertex irregular labeling
ABC index bipartite Ramsey numbers cactus converse Hölder inequality copies of graphs corona products cycle dendrite dendroid discharging method dominating set domination chromatic number domination coloring double Roman domination double Roman graph dumbbell maximal planar graphs dumbbell transformation edge corona products general Randić index generalized Petersen graph generalized Petersen graphs generalizedABC index graph graph cover hyperspace I-dumbbell maximal planar graphs linear-time algorithm local (inclusive) distance vertex irregular labeling local antimagic chromatic number local antimagic labeling multipartite Ramsey numbers NP-complete paths quasi-total Roman domination quasi-unicyclic graph Ramsey numbers Roman domination Sombor index split graphs stripes topological index topological indices total coloring total coloring algorithm total roman {3}-domination total Roman domination vertex degree Zarankiewicz number |
| 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 | ||
| ||
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 online resource (148 p.) |
| Soggetto topico |
Computer science
Information technology industries |
| Soggetto non controllato |
asymptotic growth
automata theory automata with "do not care" symbols bio-informatics communication patterns computational complexity computational complexity theory computational models control structures cP systems deterministic finite cover automata evolutional communication evolutionary processor extractors finite languages formal language formal language theory fractal Hausdorff dimension hypergraph model intrinsic perception Kolmogorov complexity logarithmic time complexity membrane computing multiple entry automata network of evolutionary processors network topology NP-complete NP-hard oracle Turing machine P systems P vs. NP problem polynomial process calculus quasiperiod random strings recursive function theory SAT shortest computations similarity relations symport/antiport theory of computation Turing machine |
| 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 online resource (108 p.) |
| Soggetto topico | Information technology industries |
| Soggetto non controllato |
ant colony optimization algorithms
approximation attention mechanism cellular networks clustering routing algorithms communication traffic prediction deep learning deformable convolution disjoint connecting paths energy efficiency intelligent traffic management metaheuristics network design network lifetime NP-complete NP-hard polynomial time algorithm reinforcement learning routing systematic review the next generation of telecommunication (5G) UAV placement underwater wireless sensor networks unmanned aerial vehicles unsplittable flow |
| 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 | ||
| ||