Fun with Algorithms [[electronic resource] ] : 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings / / edited by Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
• Edizione: 1st ed. 2007.
• Descrizione fisica: 1 online resource (280 p.)
• Disciplina: 005.1
• Soggetto topico: Software engineering; Algorithms; Artificial intelligence—Data processing; Computer science; Computer science—Mathematics; Discrete mathematics; Computer graphics; Software Engineering; Data Science; Theory of Computation; Discrete Mathematics in Computer Science; Computer Graphics
• Classificazione: 31.80
• Persona (resp. second.): PrencipeGiuseppe <1972->; PucciGeppino; CrescenziPierluigi
• Note generali: Includes index.
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features -- Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs -- Fun with Sub-linear Time Algorithms -- Wooden Geometric Puzzles: Design and Hardness Proofs -- HIROIMONO Is NP-Complete -- Tablatures for Stringed Instruments and Generating Functions -- Knitting for Fun: A Recursive Sweater -- Pictures from Mongolia – Partial Sorting in a Partial World -- Efficient Algorithms for the Spoonerism Problem -- High Spies (or How to Win a Programming Contest) -- Robots and Demons (The Code of the Origins) -- The Traveling Beams Optical Solutions for Bounded NP-Complete Problems -- The Worst Page-Replacement Policy -- Die Another Day -- Approximating Rational Numbers by Fractions -- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles -- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms -- The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake -- Drawing Borders Efficiently -- The Ferry Cover Problem -- Web Marshals Fighting Curly Link Farms -- Intruder Capture in Sierpi?ski Graphs -- On the Complexity of the Traffic Grooming Problem in Optical Networks.
• Titolo autorizzato: Fun with Algorithms
• ISBN: 1-280-94387-4; 9786610943876; 3-540-72914-3
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910767562903321
• Lo trovi qui: Univ. Federico II
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 4475