00753nam0 22002651i 450 99000671840040332120001010000671840FED01000671840(Aleph)000671840FED0100067184020001010d--------km-y0itay50------baitay-------001yyHANDBOOK of Statistics.Amsterdam-New York-OxfordNorth-Holland Publ. Co.1980v.., 24 cmITUNINARICAUNIMARCBK990006718400403321VI E 236VEDI SCHEDONEBiblioteca Centrale della Facolt| di Scienze PoliticheFSPBCFSPBCHANDBOOK of statistics119704UNINAGEN0104213nam 22009135 450 99646592990331620230221090552.01-280-94387-497866109438763-540-72914-310.1007/978-3-540-72914-3(CKB)1000000000490599(EBL)3061556(SSID)ssj0000297060(PQKBManifestationID)11243523(PQKBTitleCode)TC0000297060(PQKBWorkID)10332773(PQKB)10299191(DE-He213)978-3-540-72914-3(MiAaPQ)EBC3061556(MiAaPQ)EBC6743283(Au-PeEL)EBL6743283(OCoLC)184904992(PPN)123162815(EXLCZ)99100000000049059920100301d2007 u| 0engur|n|---|||||txtccrFun with Algorithms[electronic resource] 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings /edited by Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (280 p.)Theoretical Computer Science and General Issues,2512-2029 ;4475Includes index.3-540-72913-5 Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;4475Software engineeringAlgorithmsArtificial intelligence—Data processingComputer scienceComputer science—MathematicsDiscrete mathematicsComputer graphicsSoftware EngineeringAlgorithmsData ScienceTheory of ComputationDiscrete Mathematics in Computer ScienceComputer GraphicsSoftware engineering.Algorithms.Artificial intelligence—Data processing.Computer science.Computer science—Mathematics.Discrete mathematics.Computer graphics.Software Engineering.Algorithms.Data Science.Theory of Computation.Discrete Mathematics in Computer Science.Computer Graphics.005.131.80bclPrencipe Giuseppe1972-Pucci GeppinoCrescenzi PierluigiMiAaPQMiAaPQMiAaPQBOOK996465929903316Fun with Algorithms772446UNISA