000 03815nam a22006375i 4500
001 978-3-540-72914-3
003 DE-He213
005 20240730182049.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540729143
_9978-3-540-72914-3
024 7 _a10.1007/978-3-540-72914-3
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aFun with Algorithms
_h[electronic resource] :
_b4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings /
_cedited by Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aX, 273 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4475
505 0 _aOn 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.
650 0 _aSoftware engineering.
_94138
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer science.
_99832
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer graphics.
_94088
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aTheory of Computation.
_9127132
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Graphics.
_94088
700 1 _aCrescenzi, Pierluigi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127133
700 1 _aPrencipe, Giuseppe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127134
700 1 _aPucci, Geppino.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127135
710 2 _aSpringerLink (Online service)
_9127136
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540729136
776 0 8 _iPrinted edition:
_z9783540839187
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4475
_9127137
856 4 0 _uhttps://doi.org/10.1007/978-3-540-72914-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91213
_d91213