2
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings 

      The Computational Complexity of the Kakuro Puzzle, Revisited

      other
      ,
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references6

          • Record: found
          • Abstract: not found
          • Article: not found

          Planar Formulae and Their Uses

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            NP is as easy as detecting unique solutions

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              An Extensible SAT-solver

                Bookmark

                Author and book information

                Book Chapter
                2010
                : 319-330
                10.1007/978-3-642-13122-6_31
                4e6751df-a7d5-4f75-b430-8859512b2eca
                History

                Comments

                Comment on this book

                Book chapters

                Similar content4,129

                Cited by1