Akiyama, J.: Let’s enjoy mathematics! Let’s make mathematical instruments by yourself (in Japanese). NHK (Japan Broadcasting Corporation) Textbook for TV program for elementary-school students, episodes from July 26 to August 6 (1999)
Akiyama, J., Nakamura, G.: An efficient dissection for a sequentially n-divisible square. In: Proceedings of the Discrete and Computational Geometry Workshop, pp. 80–89. Tokyo, Japan (1997)
Akiyama, J., Nakamura, G., Nozaki, A., Ozawa, K., Sakai, T.: The optimality of a certain purely recursive dissection for a sequentially n-divisible square. Comput. Geom. Theory Appl. 24(1), 27–39 (2003)
Baxter, L.: Polyomino puzzles are NP-complete. Message on Eternity Yahoo! group. http://www.groups.yahoo.com/group/eternity/message/3988
Berger, R.: The undecidability of the domino problem. Mem. Am. Math. Soc. 66, 1–72 (1966)
Bitner, J.R., Reingold, E.M.: Backtrack programming techniques. Commun. ACM 18(11), 651–656 (1975)
Brooks, R.L., Smith, C.A.B., Stone, A.H., Tutte, W.T.: The dissection of rectangles into squares. Duke Math. J. 7, 312–340 (1940)
Conway, J.H.: Mrs. Perkins’s quilt. Proc. Camb. Philos. Soc. 60, 363–368 (1964)
Duijvestijn, A.J.W.: Simple perfect squared square of lowest order. J. Comb. Theory Ser. B 25(2), 240–243 (1978)
Epstein, L., van Stee, R.: Online square and cube packing. Acta Inf. 41(9), 595–606 (2005)
Erdős, P., Graham, R.L.: On packing squares with equal squares. J. Comb. Theory Ser. A 19, 119–123 (1975)
Freeman, H., Gardner, L.: Apictorial jigsaw puzzles: the computer solution of a problem in pattern recognition. IEEE Trans. Electron. Comput. 13, 118–127 (1964)
Friedman, E.: Packing unit squares in squares: a survey and new results. Electron. J. Combin. Dyn. Surv. DS7, November 2005. http://www.combinatorics.org/Surveys/ds7.html
Gardner, M.: Squaring the square. In: The second scientific American book of mathematical puzzles and diversions, chap. 17, pp. 186–209. The University of Chicago Press, Chicago (1961)
Gardner, M.: Mathematical games. Scientific American, pp. 110–121, January 1977. Reprinted as “Penrose Tiling,” chapt. 1 of Penrose Tiles to Trapdoor Ciphers, published by W. H. Freeman (1989) and The Mathematical Association of America (1997)
Gardner, M.: Mrs. Perkins’ quilt and other square-packing problems. In: Mathematical carnival. Vintage, New York (1977)
Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4(4), 397–411 (1975)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., San Francisco (1979)
Goldberg, D., Malon, C., Bern, M.: A global approach to automatic solution of jigsaw puzzles. In: Proceedings of the 18th Annual Symposium on Computational Geometry, pp. 82–87. Barcelona, Spain (2002)
Golomb, S. W.: Polyominoes: puzzles, patterns, problems, and packings, 2nd edn. Princeton University Press, New Jersey (1994)
Haubrich, J.: Compendium of card matching puzzles. Self-published, three volumes (1995)
Kempe, D.: On the complexity of the reflections game. Unpublished manuscript, January 2003. http://www-rcf.usc.edu/~dkempe/publications/reflections.pdf
Kong, W., Kimia, B.B.: On solving 2D and 3D puzzles using curve matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Hawaii (2001)
Leung, J.Y.-T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.L.: Packing squares into a square. J. Parallel Distrib. Comput. 10(3), 271–275 (1990)
Levin, L.A.: Average case complete problems. SIAM J. Comput. 15(1), 285–286 (1986)
Li, K., Cheng, K.H.: Complexity of resource allocation and job scheduling problems on partitionable mesh connected systems. In: Proceedings of the 1st Annual IEEE Symposium on Parallel and Distributed Processing, pp. 358–365 (1989)
Mahaney, S.R.: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis. J. Comput. Syst. Sci. 25(2), 130–143 (1982)
Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26(4), 573–590 (2001)
Pegg, E. Jr.: The eternity puzzle. http://www.mathpuzzle.com/eternity.html (2002)
Radack, G.M., Badler, N.I.: Jigsaw puzzle matching using a boundary-centered polar encoding. Comput. Graph. Image Process. 19, 1–17 (1982)
Selby, A.: Eternity page. http://www.archduke.org/eternity/, May (2006)
Skinner, J.D., II, Smith, C.A.B., Tutte, W.T.: On the dissection of rectangles into right-angled isosceles triangles. J. Combin. Theory Ser. B 80(2), 277–319 (2000)
Trustrum, G.B.: Mrs Perkins’s quilt. Proc. Camb. Philos. Soc. 61, 7–11 (1965)
Tutte, W.T.: Squaring the square. Can. J. Math. 2, 197–209 (1950)
Tutte, W.T.: The quest of the perfect square. Am. Math. Mon. 72(2, part II), 29–35 (1965)
Watson, G.N.: Mess. Math. 48, 1–22 (1918)
Williams, A.D.: Jigsaw puzzles: an illustrated history and price guide. Wallace-Homestead Book Co, Radnor, PA (1990)
Williams, A.D.: The Jigsaw puzzle: piecing together a history. Berkley Books, New York (2004)
Wolf, T.: The 702 puzzle. http://www.home.tiscalinet.ch/t_wolf/tw/misc/squares.html, May (2003)
Wolfson, H., Kalvin, A., Schonberg, E., Lambdan, Y.: Solving jigsaw puzzles by computer. Ann. Oper. Res. 12(1–4), 51–64 (1988)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4