8f97696eb0b45e6ed2297bc57ac916a271ee4d15
\350\213\261\350\252\236\350\253\226\346\226\207\343\202\273\343\203\237\343\203\212\343\203\274 2021.md
| ... | ... | @@ -0,0 +1,230 @@ |
| 1 | +# 目的 |
|
| 2 | + |
|
| 3 | +論文を読みます．４年生は各自，自分が読みたい論文を選んでください． |
|
| 4 | +2014年度までは、授業の一貫としてやっていましたが、2015年度からは研究室での取り組みとして行います． |
|
| 5 | + |
|
| 6 | +# 日程 |
|
| 7 | +開催日: 7月末を予定 |
|
| 8 | + |
|
| 9 | +原稿締切: 開催日の一週間前までにA4（表裏）1枚のレジュメを完成させる（担当教員からOKをもらう） |
|
| 10 | + |
|
| 11 | +会場: 研究室 |
|
| 12 | + |
|
| 13 | +発表時間 1人30分程度（発表12分，質疑応答18分）の予定 |
|
| 14 | + |
|
| 15 | +### レジュメ用のLaTeXスタイルファイル |
|
| 16 | +レジュメ用のLaTeXスタイルファイルは[[こちら|https://github.com/j0306043/jcourse-proceeding]]。 |
|
| 17 | +情報コースの卒業研究発表時の予稿の規定に合わせてありますので、本番の卒研発表時にもどうぞ使ってください。 |
|
| 18 | + |
|
| 19 | +# 選択論文 |
|
| 20 | + |
|
| 21 | +選んだ論文を記入してください． |
|
| 22 | +すでに他の人が選んだ論文と同じ論文は選べません。 |
|
| 23 | +ぶつかった場合には調整が必要です。 |
|
| 24 | + |
|
| 25 | +* 氏名 : 論文タイトル |
|
| 26 | +*1) 田中隆晟 ： Ternary Toffoli-type Reversible Gates: Control Alternatives and Quantum Models |
|
| 27 | +*2) 服部龍二 ： Machine-learning prediction of d-band center for metals and bimetals |
|
| 28 | +*3) 信樂昂輝 ： Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems |
|
| 29 | +*4) 加藤俊哉 : Remarks on Peculiar Properties of Ternary Bent Function and Construction Algorithms |
|
| 30 | +*5) 野坂優二郎 : A Formal Approach to Identifying Hardware Trojans in Cryptographic Hardware |
|
| 31 | +*6) 中津山叫 : Synthesis of Asymptotically Optimal Adders for Multiple-Valued Logic |
|
| 32 | +*7) 早坂圭矢 : An FPGA Implementation of 4×4 Arbiter PUF |
|
| 33 | +*8) 太田涼平 ： Super Mari Bros. Is Harder/Easier than We Thought |
|
| 34 | +*9) 伊藤幹人 : Optimal reconfiguration of optimal ladder lotteries |
|
| 35 | +*10) 福田拳心 ： CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration |
|
| 36 | + |
|
| 37 | +# 論文候補 |
|
| 38 | + |
|
| 39 | +自分が読みたい論文を選んでください． |
|
| 40 | + |
|
| 41 | +### by Hirayama |
|
| 42 | + |
|
| 43 | +以下から選んでみてください。 |
|
| 44 | +論文はまだ追加されるかもしれませんが、今あるうちから選んでかまいません。 |
|
| 45 | + |
|
| 46 | +* Proceedings of ISMVL 2021から (~hirayama/Papers/4jkenshu-2021/ISMVL2021-Accepted-Draft/参照)。 平山が注目している論文は、No. 3, 7, 9, 10, 14, 15, 16, 17, 19, 22, 24, 34, 42, 44, 46. |
|
| 47 | +* 昨年の候補から(~hirayama/Papers/4jkenshu-2020/) |
|
| 48 | +* 過去の候補から(~hirayama/Papers/4jkenshu-20??/) |
|
| 49 | +* ページ下方の「By M1」や「By M2」から |
|
| 50 | +* 下記の候補から |
|
| 51 | + |
|
| 52 | +これらの論文のPDFおよび出典情報は、~hirayama/Papers/4jkenshu-2021/にあります。 |
|
| 53 | +.pdfが論文のPDFファイルで、.txtが論文の出典情報です。 |
|
| 54 | + |
|
| 55 | +* Gaur2019_Design_of_Reversible_Arithmetic_Logic_Unit_with_Built-In_Testability.pdf |
|
| 56 | +* Hattori2019_Mapping_a_Quantum_Circuit_to_2D_Nearest_Neighbor_Architecture_by_Changing_the_Gate_Order.pdf |
|
| 57 | +* Hirahara2018_NP-hardness_of_Minimum_Circuit_Size_Problem_for_OR-AND-MOD_Circuits.pdf |
|
| 58 | +* Ilango2020_NP-Hardness_of_Circuit_Minimization_for_Multi-Output_Functions.pdf |
|
| 59 | +* Morimae2019_Fine-grained_quantum_computational_supremacy.pdf |
|
| 60 | +* Pedram2016_Layout_Optimization_for_Quantum_Circuits_with_Linear_Nearest_Neighbor_Architectures.pdf |
|
| 61 | +* Shafaei2013_Optimization_of_Quantum_Circuits_for_Interaction_Distance_in_Linear_Nearest_Neighbor_Architectures.pdf |
|
| 62 | + |
|
| 63 | +### by Yamanaka |
|
| 64 | + |
|
| 65 | +読みたい論文の候補を作ってから私に相談してください．相談しながら決めましょう． |
|
| 66 | +インターネットで検索すれば論文のPDFファイルは見れることがほとんどです（ただし，大学のネットワークから検索してください）． |
|
| 67 | +見つけられない場合は，私が送ります． |
|
| 68 | + |
|
| 69 | +<!-- |
|
| 70 | +#### Calibration |
|
| 71 | +* Talat Ozyagcilar, Calibrating an eCompass in the Presence of Hard and Soft-Iron Interference, Freescale Semiconductor, Application Note, No. AN4246, 2013. |
|
| 72 | +* Talat Ozyagcilar, Implementing a Tilt-Compensated eCompass using Accelerometer and Magnetometer Sensors, Freescale Semiconductor, Application Note, No. AN4246, 2013. |
|
| 73 | +--> |
|
| 74 | + |
|
| 75 | + |
|
| 76 | +#### Machine Learning |
|
| 77 | +* A. Yada, K. Nagata, Y. Ando, T. Matsumura, S. Ichinoseki, and K. Sato, Machine learning approach for prediction of reaction yield with simulated catalyst parameters, Chemistry Letters, no.3, vol.47, 2018. [YadaNAMIS2018.pdf] |
|
| 78 | +* D.T. Ahneman, J.G. Estrada, S. Lin, S.D. Dreher, and A.G. Doyle, Predicting reaction performance in C–N cross-coupling using machine learning, Science, vol.360, no.6385, April 2018. [AhnemanELDD-science-2018.pdf] |
|
| 79 | +* T. Korenaga, R. Sasaki, T. Takemoto, T. Yasuda, and M. Watanabe, Computationally-Led Ligand Modification using Interplay between Theory and Experiments: Highly Active Chiral Rhodium Catalyst Controlled by Electronic Effects and CH–p Interactions, Advanced Synthesis and Catalysis, vol. 360, pp.322–333, 2017. |
|
| 80 | +* D. Duvenaud, D. Maclaurin, J.A. Iparraguirre, R.G. Bombarelli, T. Hirzel, A.A. Guzik, R.P. Adams, Convolutional Networks on Graphs for Learning Molecular Fingerprints, in Proceedings of Advances in Neural Information Processing Systems 28 (NIPS2015), pp.2224-2232, 2015. |
|
| 81 | +* T. Toyao, K. Suzuki, S. Kikuchi, S. Takakusagi, K. Shimizu, I. Takigawa, Toward effective utilization of methane: machine learning prediction of adsorption energies on metal alloys, J. Phys. Chem. C, 2018, 122 (15): 8315-8326. |
|
| 82 | +* I. Takigawa, H. Mamitsuka, Generalized sparse learning of linear models over the complete subgraph feature set, IEEE Trans. Pattern Anal. Mach. Intell. 2017, 39 (3): 617-624. |
|
| 83 | +* I. Takigawa, K. Shimizu, K. Tsuda, S. Takakusagi, Machine-learning prediction of d-band center for metals and bimetals, RSC Adv. 2016, 6: 52587-52595. |
|
| 84 | +* I. Takigawa, H. Mamitsuka, Efficiently mining δ-tolerance closed frequent subgraphs, Machine Learning, 2011, 82 (2): 95-121. |
|
| 85 | + |
|
| 86 | + |
|
| 87 | +#### Exact Exponential Algorithms |
|
| 88 | + |
|
| 89 | +* R. Bellman, Dynamic Programming Treatment of the Travelling Salesman Problem, J. ACM, vol.9, pp.61-63, 1962. |
|
| 90 | +* M. Held and R.M. Karp, A dynamic programming approach to sequencing problems, Journal of SIAM, vol.10, pp.196-210, 1962. [HK62.pdf] |
|
| 91 | +[](* A.P. Golovach, P. Heggernes, D. Kratsch, Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs, Proc. of IWOCA 2015, pp.235-247, 2015. [GHK17.pdf]) |
|
| 92 | +* R.E. Tarjan and A.E. Trojanowski, Finding a maximum independent set, SIAM J. Comput. 6(3), 537-546, 1977. |
|
| 93 | + |
|
| 94 | +<!-- |
|
| 95 | +#### Graph Algorithms |
|
| 96 | + |
|
| 97 | +* N. Chiba and T. Nishizeki, The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-connected Planar Graphs, Journal of Algorithms, vol.10, pp.187-211, 1989. [CN89.pdf] |
|
| 98 | +--> |
|
| 99 | + |
|
| 100 | +#### Floorplans |
|
| 101 | + |
|
| 102 | +* G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, vol.172, no.1–2, pp.175-193, 1997. |
|
| 103 | + |
|
| 104 | +<!-- |
|
| 105 | +* G. Kant and X. He, Two Algorithms for Finding Rectangular Duals of Planar Graphs, Proc of International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1993), e Lecture Notes in Computer Science, vol.790, pp.396-410, 1993. |
|
| 106 | +* An O(n) algorithm for determining the subregion-tree representation of a rectangular dissection, SIAM Journal of Computing, vol.22, no.1, pp.79-101, Feb 1993. |
|
| 107 | +--> |
|
| 108 | + |
|
| 109 | +* Z.C. Shen and C.C.N. Chu, Bounds on the Number of Slicing, Mosaic, and General Floorplans, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.22, no.10, Oct. 2003. |
|
| 110 | + |
|
| 111 | +[](* E. Ackerman, G. Barequet, and R.Y. Pinter, A bijection between permutations and foorplans, and its applications, Discrete Applied Mathematics, vol.154, pp.1674--1684, 2006. [ABP06.pdf]) |
|
| 112 | + |
|
| 113 | +#### Algorithm and Computational Complexity |
|
| 114 | + |
|
| 115 | +* E.D. Demaine, G. Viglietta, and A. Williams, Super Mario Bros. Is Harder/Easier than We Thought, Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016), LIPIcs, vol.49, pp.13:1--13:14, 2016. |
|
| 116 | + |
|
| 117 | +* G. Aloupis, E.D. Demaine, A. Guo, and G. Viglietta, Classic nintendo games are (computationally) hard, In Proceedings of The 7th International Conference on FUN with Algorithms (FUN 2014), Lecture Notes in Computer Science, vol.8496, pp.40-51, 2014. |
|
| 118 | +* M.R. Garey and D.S. Johnson, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, no.3, pp.237-267, 1976. [GJ76.pdf] |
|
| 119 | +[](* M. Karchmer, R. Raz, and A. Wigderson, Super-logarithmic depth lower bounds via the direct sum in communication complexity, Computational Complexity vol.5, no.3-4, pp.191-204, 1995. [KRW95]) |
|
| 120 | +* V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters, vol.37, pp.27-35, 1991. |
|
| 121 | + |
|
| 122 | +<!-- |
|
| 123 | +#### Graph Encodings |
|
| 124 | + |
|
| 125 | +//* L.C. Aleardi, O. Devillers, Explicit array-based compact data structures for triangulations Proc. 22nd International Symposium on Algorithms and Computation //(ISAAC 2011), LNCS 7074, pp.312-322 2011. [AD11.pdf, AD11-draft.pdf] |
|
| 126 | +//* J. Janssona, K. Sadakane, and W. Sung, Ultra-succinct representation of ordered trees with applications, Journal of Computer and System Sciences, vol.78, //pp.619--631, 2012. [JSS12.pdf] |
|
| 127 | +//* J. Barbay, L.C. Aleardi, M. He, and J.I. Munro, Succinct representation of labeled graphs, Algorithmica, vol.62, no.1-2, pp.224-257. [BAHM12.pdf] |
|
| 128 | +// //* L.C. Aleardi, L.Devillers, and G. Schaeffer, Succinct representation of triangulations with a boundary, Proc. 9th Workshop on Algorithms and Data Structures (WADS 2005), LNCS 3608, pp.134-135, 2005. [ADS05.pdf] |
|
| 129 | +// * D. Benoit, E.D. Demaine, J.I. Munro, R. Raman, V. Raman, and S.S. Rao, Representing Trees of Higher Degree, vol.43, no.4, pp.275-292, 2005. [BDMRRR05.pdf] |
|
| 130 | +// * D.K. Blandford, G.E. Blelloch and I.A. Kash, Compact Representations of Separable Graphs, Proc. Symposium on Discrete Mathematics (SODA2003), pp.679-688, 2003. |
|
| 131 | +// * A. Farzan and J.I. Munro, A Uniform Paradigm to Succinctly Encode Various Families of Trees, Algorithmica, vol.???, pp.???-???, 2012. |
|
| 132 | +// * A. Farzan and J.I. Munro, A Uniform Approach Towards Succinct Representation of Trees, Proc. the 11th Scandinavian Workshop on Algorithm Theory (SWAT2008), LNCS 5124, pp.173-184, 2008. [FM08.pdf] |
|
| 133 | +// * P. Ferragina, I. Nitto, and R. Venturini, On compact representations of al-pairs-shortest-path-distance matrices, Theoretical Computer Science, vol.411, pp.3293-3300, 2010. |
|
| 134 | +// * R.F. Geary, R. Raman, and V. Raman, Succinct ordinal trees with level-ancestor queries, ACM Transactions on Algorithms, vol.2, no.4, pp.510-534, 2006. [GR06.pdf] |
|
| 135 | +// //* B. He, Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations, Proc. The Joint International Conference, The Sixth International Frontiers of Algorithmics Workshop (FAW 2012) and The Eighth International Conference on Algorithmic Aspects of Information and Management (AAIM 2012), LNCS, vol.7285, pp.1-12, 2012. |
|
| 136 | +// * D. Poulalhon and G. Schaeffer, Optimal Coding and Sampling of Triangulations, Algorithmica, vol.46, no.3, pp.505-527, 2006. |
|
| 137 | +// * S. Joannou and R. Raman, Dynamizing Succinct Tree Representations, Proc. International Symposium on Experimental Algorithms (SEA), LNCS, vol.7276,pp.224-235, 2012. [JR12.pdf] |
|
| 138 | +// * K. Keeler and J. Westbrook, Short Encodings of Planar Graphs and Maps, Discrete Applied Mathematics, vol.58, pp.239-252, 1995. [KW95.pdf] |
|
| 139 | +// * J.I. Munro and V. Raman, Succinct Representation of Balanced Parentheses and Static Trees, SIAM Journal on Computing, vol.31, no.3, pp.762-776, 2001. [MR01.pdf] |
|
| 140 | +// //* M. Naor, |
|
| 141 | +// // Succinct Representation of General Unlabeled Graphs |
|
| 142 | +// // Discrete Applied Mathematics, vol.28, pp.303-307, 1990. |
|
| 143 | +// // [Draft version: N90.ps, Article version: only hard copy.] |
|
| 144 | +// * G. Turan, On the Succinct Representation of Graphs, Discrete Applied Mathematics, vol.8, pp.289-294, 1984. [T84.pdf] |
|
| 145 | + |
|
| 146 | +// #### Succinct Data Structures |
|
| 147 | + |
|
| 148 | +// * J.I. Munro and S.S. Rao, Succinct representations of functions, Proc. International Colloquium on Automata, Languages and Programming (ICALP 2004), LNCS 3142, pp.1006-1015, 2004. [MR04.pdf] |
|
| 149 | +// * G. Navarro and E. Providel, Fast, Small, Simple Rank/Select on Bitmaps, LNCS, vol.7276, pp 295-306, 2012. [NP12.pdf] |
|
| 150 | +// * Mihai Patrascu, Succincter, Proc. 49th IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp.305-313, 2008. [P08.pdf] |
|
| 151 | +--> |
|
| 152 | + |
|
| 153 | +#### Token-swapping, Amidakuji and Permutation |
|
| 154 | + |
|
| 155 | +* A. Caprara, Sorting Permutations by Reversals and Eulerian Cycle Decompositions, SIAM Journal on Discrete Mathemtics, vol.12, no.1, pp.91--110, 1999. |
|
| 156 | + |
|
| 157 | +<!-- |
|
| 158 | +//* S. Even and O. Goldreich, The minimum-length generator sequence problem is NP-hard, Journal of Algorithms, vol.2, pp.311-313, 1981. |
|
| 159 | +//* S. Felsner and P. Valtrl, |
|
| 160 | +// Coding and Counting Arrangements of Pseudolines, |
|
| 161 | +// Discrete & Computational Geometry, to appear. |
|
| 162 | +// [FV11.pdf] |
|
| 163 | +--> |
|
| 164 | + |
|
| 165 | +* S. Felsner On the number of arrangements of pseudolines, Discrete & Computational Geometry, vol.18, pp.257-267, 1997. [F97.pdf] |
|
| 166 | + |
|
| 167 | +<!-- |
|
| 168 | +// * L.S. Heath and J.P.C. Vergara, Sorting by short swaps, Journal of Computational Biology, vol.10, no.5, pp.775-789, 2003. |
|
| 169 | +//* S. Iwata, Lower Bounds for Merging Networks, Information and Computation, vol.168, pp.187-195, 2001. [S01.pdf] (Challenging) |
|
| 170 | +--> |
|
| 171 | + |
|
| 172 | +* M.R. Jerrum, The Complexity of Finding Minimum-length Generator Sequences, Theoretical Computer Science, vol.36, pp.265-289, 1985. [J85.pdf] |
|
| 173 | +* M. Jerrum, A Compact Representation for Permutation Groups, Journal of Algorithms vol.7, pp.60-78, 1986. |
|
| 174 | + |
|
| 175 | +<!--* S. Minato, piDD: A new decision diagram for efficient problem solving in permutation space, Proc. of 14th International Conference on Theory and Applications of Satisfiability Testing(SAT 2011), pp.90-104, 2011 [M11.pdf])--> |
|
| 176 | +* J. Kawahara, T. Saitoh, and R. Yoshinaka, The time complexity of the token swapping problem and its parallel variants, Proc. of 11th Internatioal Conference and Workshops on Algorithms and Computation, Lecture Notes on Computer Science, vol.10167, pp.448-459, 2017 |
|
| 177 | + |
|
| 178 | +#### Enumeration and Counting |
|
| 179 | + |
|
| 180 | +* A. Conte and E. Tomita, Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms, Proceedings of the 15th International Workshop on Algorithms and Computation (WALCOM2021), pp.197-207, 2021. [ConteT2021_walcom2021.pdf] |
|
| 181 | +* R. Shibukawa, S. Ishida, K. Yoshizoe, K. Wasa, K. Takasu, Y. Okuno, K. Terayama, and K. Tsuda, CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration, Journal of Cheminformatics, no.1, vol.12, pp.1-14. |
|
| 182 | + |
|
| 183 | +<!-- |
|
| 184 | +//* (*) D. Avis, Generating rooted triangulations without repetitions, Algorithmica, vol.16, pp.618-632. [A96.pdf] |
|
| 185 | +//* Y. Okamoto, R. Uehara, and T. Uno, Counting the Number of Independent Sets in Chordal Graphs, Journal of Discrete Algorithms, 2007. [OUU07.pdf] |
|
| 186 | +//* G. Brightwell and P. Winkler, Counting Linear Extensions, Order vol.8, pp.225-242, 1991. [BW91.pdf] |
|
| 187 | +//* A. Alhazov, K. Morita, and C. Iwamoto, A Note on Tatami Tilings, LA Winter Symposium [2], 2009. [AMI09.pdf] |
|
| 188 | +//* (*) S. Bespamyatnikh, An efficient algorithm for enumeration of triangulations, Computational Geometry, vol.23, pp.271-279, 2002. |
|
| 189 | +--> |
|
| 190 | + |
|
| 191 | +* L.A. Goldberg, Efficient Algorithms for Listing Unlabeled Graphs, Journal of Algorithms vol.13, pp.128-143, 1992. [hard copy only] (challenging) |
|
| 192 | +* P.A. Golovach, P. Heggernes, D. Kratsch, Enumerating minimal connected dominating sets in graphs of bounded chordality, Theoretical Computer Science, vol.630, pp.63-75, 2016. |
|
| 193 | +* P. Hanlon, Counting Interval Graphs, Transactions of the Mathematical Society, vol.272, no.2, pp.383-426, 1982. [H82.pdf] (challenging) |
|
| 194 | + |
|
| 195 | +<!-- |
|
| 196 | +// * (*) N. Katoh and S. Tanigawa, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, Discrete Applied Mathematics, vol.157, pp.3569-3585, 2009. |
|
| 197 | +//* F. Ruskey and J. Woodcock, Counting Fixed-Height Tatami Tilings, Electronic Journal of Combinatorics, R126, (20 pages) 2009. [RW09.pdf] (challenging) |
|
| 198 | +--> |
|
| 199 | + |
|
| 200 | +* S. Maxwell, M.R. Chance, and M. Koyuturk, Efficiently enumerating all connected induced subgraphs of a large molecular network, Proc of AlCoB 2014, LNBI, vol.8542, pp.171-182, 2014 |
|
| 201 | +* K. Tani, I. Shirakawa, and S. Tsukiyama, An Algorithm to Enumerate All Rectangular Dual Graphs, Electronics and Communications in Japan, Part 3, vol.3, pp.52-62, 1989. [TST89.pdf] |
|
| 202 | +* (*) R.C. Read and R.E. Tarjan, Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning. Trees, Networks 5, 237-252, 1975. |
|
| 203 | +* T Uno, Constant Time Enumeration by Amortization. In Proc. of Symposium on Algorithms and Data Structures (WADS 2015), Lecture Notes in Computer Science, vol 9214, pp.593-605, 2015. U15.pdf |
|
| 204 | +* K. Wasa, H. Arimura, and T. Uno, Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph, Proc. of ISAAC 2014, pp 94-102, 2014. |
|
| 205 | + |
|
| 206 | +#### Reconfiguration Problems |
|
| 207 | +* T. Ito, E.D. Demaine, N.J.A. Harvey, C.H. Papadimitriou, M. Sideri, R. Uehara, Y. Uno, On the complexity of reconfiguration problems, Theoretical Computer Science, vol.412, pp.1054-1065, 2011. [IDHPSUU11.pdf] |
|
| 208 | +* A.E. Mouawad, N. Nishimura, V. Raman, N. Simjour, and A. Suzuki, On the parameterized complexity of reconfiguration problems, Proc. of IPEC, LNCS, vol.8246, pp.281-294, 2013. |
|
| 209 | + |
|
| 210 | +<!-- |
|
| 211 | +//#### Computational Geometry |
|
| 212 | + |
|
| 213 | +//* T. Shermer, Computing bushy and thin triangulations, Computational Geometry: Theory and Applications, vol.1, pp.115-125, 1991. |
|
| 214 | + |
|
| 215 | + |
|
| 216 | +//#### Circuits, logic function, SAT, etc. |
|
| 217 | + |
|
| 218 | +//* K.A. Berman, J. Franco, and J.S. Schlipf, Unique Satisfiability of Horn sets can be solved in nearly linear time, Discrete Applied Mathematics, vol.60, pp.77--91, 1995. [BFS95.pdf] |
|
| 219 | +//* M. Minoux, The Unique Horn-Satisfiability problem and quadratic Boolean equations, Annals of Mathematics and Artificial Intelligence, vol.6, pp.253--266, 1992. [M92.pdf] |
|
| 220 | +//* K. Tabei and T. Yamada, On Generating Test Sets for Reversible Circuits, Proc. of the IEEE International Conference on Computer Engineering and Systems, pp.94-99, 2009. [TY09.pdf] |
|
| 221 | +--> |
|
| 222 | + |
|
| 223 | +#### Misc. |
|
| 224 | +A. Shafaei, M. Saeedi, and M. Pedram, Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures, in Proceedings of the 50th Annual Design Automation Conference (DAC '13), pp.1-6. |
|
| 225 | + |
|
| 226 | +### by M2 Akaishi |
|
| 227 | + |
|
| 228 | +### by M1 Matsuura |
|
| 229 | + |
|
| 230 | +### by M1 Watanabe |
|
| ... | ... | \ No newline at end of file |