top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Algorithms and Complexity : 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / / edited by Tiziana Calamoneri, Federico Corò
Algorithms and Complexity : 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / / edited by Tiziana Calamoneri, Federico Corò
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (XI, 410 p. 33 illus.)
Disciplina 511.8
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer graphics
Computer science—Mathematics
Computer systems
Artificial intelligence
Design and Analysis of Algorithms
Computer Graphics
Symbolic and Algebraic Manipulation
Computer System Implementation
Artificial Intelligence
Algorismes
Complexitat computacional
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 3-030-75242-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Abundant Extensions -- Three Problems on Well-Partitioned Chordal Graphs -- Distributed Distance-r Covering Problems on Sparse High-Girth Graphs -- Reconfiguration of Connected Graph Partitions via Recombination -- Algorithms for Energy Conservation in Heterogeneous Data Centers -- On Vertex-Weighted Graph Realizations -- On the Role of 3's for the 1-2-3 Conjecture -- Upper Tail Analysis of Bucket Sort and Random Tries -- Throughput Scheduling with Equal Additive Laxity -- Fragile Complexity of Adaptive Algorithms -- FPT and Kernelization Algorithms for the Induced Tree Problem -- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs -- Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation -- A Multistage View on 2-Satisfiability -- The Weisfeiler-Leman Algorithm and Recognition of Graph Properties -- The Parameterized Suffix Tray -- Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity -- Covering a Set of Line Segments with a Few Squares -- Circumventing Connectivity for Kernelization -- Online and Approximate Network Construction from Bounded Connectivity Constraints -- Globally Rigid Augmentation of Minimally Rigid Graphs in \(R^2\) -- Extending Partial Representations of Rectangular Duals with Given Contact Orientations -- Can Local Optimality be Used for Efficient Data Reduction -- Colouring Graphs of Bounded Diameter in the Absence of Small Cycles -- Online Two-Dimensional Vector Packing with Advice -- Temporal Matching on Geometric Graph Data.
Record Nr. UNINA-9910483444703321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Complexity and emergence : Lake Como School of Advanced Studies, Italy, July 22-27, 2018 / / edited by Sergio Albeverio, [and three others]
Complexity and emergence : Lake Como School of Advanced Studies, Italy, July 22-27, 2018 / / edited by Sergio Albeverio, [and three others]
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (208 pages)
Disciplina 501
Collana Springer Proceedings in Mathematics and Statistics
Soggetto topico Complexity (Philosophy)
Complexitat (Filosofia)
Complexitat computacional
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 3-030-95703-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996479370503316
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computational complexity : CC
Computational complexity : CC
Pubbl/distr/stampa Basel, : Birkhäuser
Disciplina 511.352
Soggetto topico Computational complexity
Complexité de calcul (Informatique)
Complexitat computacional
Soggetto genere / forma periodicals.
Periodicals.
Périodiques.
Revistes electròniques.
ISSN 1420-8954
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Altri titoli varianti CC
Record Nr. UNINA-9910143260403321
Basel, : Birkhäuser
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Journal of systems science and complexity
Journal of systems science and complexity
Pubbl/distr/stampa [Beijing, China] : , : [New York, N.Y.] : , : [Science Press] : , : [Allerton Press (foreign)], , [2001]-
Descrizione fisica 1 online resource
Disciplina 003
Soggetto topico System theory
Mathematics
System analysis
Computational complexity
Teoria de sistemes
Matemàtica
Anàlisi de sistemes
Complexitat computacional
Soggetto genere / forma Periodicals.
Revistes electròniques
ISSN 1559-7067
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Altri titoli varianti Journal of systems science & complexity
JSSC
Record Nr. UNINA-9910144064303321
[Beijing, China] : , : [New York, N.Y.] : , : [Science Press] : , : [Allerton Press (foreign)], , [2001]-
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Research in computational topology 2 / / Ellen Gasparovic, Vanessa Robins, and Katharine Turner, editors
Research in computational topology 2 / / Ellen Gasparovic, Vanessa Robins, and Katharine Turner, editors
Pubbl/distr/stampa Cham, Switzerland : , : Springer International Publishing, , [2022]
Descrizione fisica 1 online resource (304 pages)
Disciplina 516.00285
Collana Association for Women in Mathematics
Soggetto topico Geometry - Data processing
Topology - Data processing
Topologia
Geometria
Processament de dades
Complexitat computacional
Algorismes
Soggetto genere / forma Llibres electrònics
ISBN 3-030-95519-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996479369903316
Cham, Switzerland : , : Springer International Publishing, , [2022]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
SIGACT news
SIGACT news
Pubbl/distr/stampa New York, NY, : ACM Special Interest Group on Automata and Computability Theory
Disciplina 511.3
Soggetto topico Machine theory
Computational complexity
Computer algorithms
Informàtica
Complexitat computacional
Enginyeria mecànica
Soggetto genere / forma Periodicals.
Revistes electròniques.
ISSN 1943-5827
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Altri titoli varianti Special Interest Group on Automata and Computability Theory news
Special Interest Group on Algorithms and Computation Theory news
ACM SIGACT news
Record Nr. UNINA-9910375866203321
New York, NY, : ACM Special Interest Group on Automata and Computability Theory
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui