Even 1 × <i>n</i> Edge-Matching and Jigsaw Puzzles are Really Hard-Reference-Cited by-同舟云学术

Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard

Published:2017 Issue:0 Volume:25 Page:682-694
ISSN:1882-6652
Container-title:Journal of Information Processing
language:en
Short-container-title:Journal of Information Processing

Author:

Bosboom Jeffrey¹,Demaine Erik D.¹,Demaine Martin L.¹,Hesterberg Adam¹,Manurangsi Pasin²,Yodpinyanee Anak¹

Affiliation:

1. Massachusetts Institute of Technology

2. University of California, Berkeley

Publisher

Information Processing Society of Japan

Subject

General Computer Science

Link

https://www.jstage.jst.go.jp/article/ipsjjip/25/0/25_682/_pdf

Reference20 articles.

1. [1] Antoniadis, A. and Lingas, A.: Approximability of Edge Matching Puzzles, Proc. 36th Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science, Vol.5901, pp.153-164, Špindlerův Mlýn, Czech Republic (2010).

2. [2] Arora, S., Lund, C., Motwani, R., Sudan, M. and Szegedy, M.: Proof Verification and the Hardness of Approximation Problems, J. ACM, Vol.45, No.3, pp.501-555 (1998).

3. [3] Arora, S. and Safra, S.: Probabilistic Checking of Proofs: A New Characterization of NP, J. ACM, Vol.45, No.1, pp.70-122 (1998).

4. [4] Bellare, M., Goldreich, O. and Sudan, M.: Free Bits, PCPs, and Nonapproximability — Towards Tight Results, SIAM Journal on Computing, Vol.27, No.3, pp.804-915 (1998).

5. [5] Cook, S.A.: The Complexity of Theorem-proving Procedures, Proc. 3rd Annual ACM Symposium on Theory of Computing, pp.151-158, Shaker Heights, Ohio, USA (1971).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hand-drawn cadastral map parsing, stitching and assembly via jigsaw puzzles;International Journal on Document Analysis and Recognition (IJDAR);2024-05-14

2. Solving computational square jigsaw puzzles with a novel pairwise compatibility measure;Journal of King Saud University - Computer and Information Sciences;2020-10

3. On Computational Complexity of Pipe Puzzles;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-09-01

4. A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles;Combinatorics, Probability and Computing;2019-01-08