逻辑优化 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "逻辑优化" in Chinese language version.

refsWebsite

Global rank Chinese rank

6web.archive.org

1^st place

3doi.org

2^nd place

23^rd place

2epfl.ch

4,521^st place

2,540^th place

1sciencedirect.com

149^th place

292^nd place

1europa.eu

68^th place

209^th place

1columbia.edu

488^th place

823^rd place

1caltech.edu

887^th place

966^th place

caltech.edu (Global: 887^th place; Chinese: 966^th place)

users.cms.caltech.edu

Buchfuhrer, David; Umans, Christopher. The complexity of Boolean formula minimization (PDF). Journal of Computer and System Sciences (JCSS) (Computer Science Department, California Institute of Technology, Pasadena, California, USA: Elsevier Inc.). January 2011, 77 (1): 142–153 [2024-04-02]. doi:10.1016/j.jcss.2010.06.011. （原始内容存档 (PDF)于2018-01-14）. This is an extended version of the conference paper: Buchfuhrer, David; Umans, Christopher. The Complexity of Boolean Formula Minimization. Proceedings of Automata, Languages and Programming (PDF). 35th International Colloquium (ICALP). Lecture Notes in Computer Science (LNCS) 5125 (Berlin / Heidelberg, Germany: Springer-Verlag). 2008: 24–35 [2018-01-14]. ISBN 978-3-540-70574-1. doi:10.1007/978-3-540-70575-8_3. （原始内容存档 (PDF)于2018-01-14）.

columbia.edu (Global: 488^th place; Chinese: 823^rd place)

academiccommons.columbia.edu

Theobald, M.; Nowick, S. M. Fast heuristic and exact algorithms for two-level hazard-free logic minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. November 1998, 17 (11): 1130–1147 [2024-04-02]. doi:10.1109/43.736186. （原始内容存档于2024-04-02）.

doi.org (Global: 2^nd place; Chinese: 23^rd place)

Maxfield, Clive "Max". Chapter 5: "Traditional" Design Flows. Maxfield, Clive "Max" (编). FPGAs. Instant Access. Burlington: Newnes / Elsevier Inc. 2008-01-01: 75–106 [2021-10-04]. ISBN 978-0-7506-8974-8. doi:10.1016/B978-0-7506-8974-8.00005-3. （原始内容存档于2023-02-21）.
Theobald, M.; Nowick, S. M. Fast heuristic and exact algorithms for two-level hazard-free logic minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. November 1998, 17 (11): 1130–1147 [2024-04-02]. doi:10.1109/43.736186. （原始内容存档于2024-04-02）.
Buchfuhrer, David; Umans, Christopher. The complexity of Boolean formula minimization (PDF). Journal of Computer and System Sciences (JCSS) (Computer Science Department, California Institute of Technology, Pasadena, California, USA: Elsevier Inc.). January 2011, 77 (1): 142–153 [2024-04-02]. doi:10.1016/j.jcss.2010.06.011. （原始内容存档 (PDF)于2018-01-14）. This is an extended version of the conference paper: Buchfuhrer, David; Umans, Christopher. The Complexity of Boolean Formula Minimization. Proceedings of Automata, Languages and Programming (PDF). 35th International Colloquium (ICALP). Lecture Notes in Computer Science (LNCS) 5125 (Berlin / Heidelberg, Germany: Springer-Verlag). 2008: 24–35 [2018-01-14]. ISBN 978-3-540-70574-1. doi:10.1007/978-3-540-70575-8_3. （原始内容存档 (PDF)于2018-01-14）.

epfl.ch (Global: 4,521^st place; Chinese: 2,540^th place)

si2.epfl.ch

Haaswijk, Winston. SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism (PDF). EPFL. [2022-11-07]. （原始内容存档 (PDF)于2023-11-27）.
Haaswijk, Winston. SAT-Based Exact Synthesis for Multi-Level Logic Networks (PDF). EPFL. [2022-11-07]. （原始内容存档 (PDF)于2023-11-27）.

europa.eu (Global: 68^th place; Chinese: 209^th place)

ec.europa.eu

Balasanyan, Seyran; Aghagulyan, Mane; Wuttke, Heinz-Dietrich; Henke, Karsten. Digital Electronics (PDF). Bachelor Embedded Systems - Year Group. Tempus. 2018-05-16 [2021-10-04]. DesIRE. （原始内容存档 (PDF)于2021-10-04）. (101 pages)

sciencedirect.com (Global: 149^th place; Chinese: 292^nd place)

Maxfield, Clive "Max". Chapter 5: "Traditional" Design Flows. Maxfield, Clive "Max" (编). FPGAs. Instant Access. Burlington: Newnes / Elsevier Inc. 2008-01-01: 75–106 [2021-10-04]. ISBN 978-0-7506-8974-8. doi:10.1016/B978-0-7506-8974-8.00005-3. （原始内容存档于2023-02-21）.

web.archive.org (Global: 1^st place; Chinese: 1^st place)

Maxfield, Clive "Max". Chapter 5: "Traditional" Design Flows. Maxfield, Clive "Max" (编). FPGAs. Instant Access. Burlington: Newnes / Elsevier Inc. 2008-01-01: 75–106 [2021-10-04]. ISBN 978-0-7506-8974-8. doi:10.1016/B978-0-7506-8974-8.00005-3. （原始内容存档于2023-02-21）.
Balasanyan, Seyran; Aghagulyan, Mane; Wuttke, Heinz-Dietrich; Henke, Karsten. Digital Electronics (PDF). Bachelor Embedded Systems - Year Group. Tempus. 2018-05-16 [2021-10-04]. DesIRE. （原始内容存档 (PDF)于2021-10-04）. (101 pages)
Theobald, M.; Nowick, S. M. Fast heuristic and exact algorithms for two-level hazard-free logic minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. November 1998, 17 (11): 1130–1147 [2024-04-02]. doi:10.1109/43.736186. （原始内容存档于2024-04-02）.
Buchfuhrer, David; Umans, Christopher. The complexity of Boolean formula minimization (PDF). Journal of Computer and System Sciences (JCSS) (Computer Science Department, California Institute of Technology, Pasadena, California, USA: Elsevier Inc.). January 2011, 77 (1): 142–153 [2024-04-02]. doi:10.1016/j.jcss.2010.06.011. （原始内容存档 (PDF)于2018-01-14）. This is an extended version of the conference paper: Buchfuhrer, David; Umans, Christopher. The Complexity of Boolean Formula Minimization. Proceedings of Automata, Languages and Programming (PDF). 35th International Colloquium (ICALP). Lecture Notes in Computer Science (LNCS) 5125 (Berlin / Heidelberg, Germany: Springer-Verlag). 2008: 24–35 [2018-01-14]. ISBN 978-3-540-70574-1. doi:10.1007/978-3-540-70575-8_3. （原始内容存档 (PDF)于2018-01-14）.
Haaswijk, Winston. SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism (PDF). EPFL. [2022-11-07]. （原始内容存档 (PDF)于2023-11-27）.
Haaswijk, Winston. SAT-Based Exact Synthesis for Multi-Level Logic Networks (PDF). EPFL. [2022-11-07]. （原始内容存档 (PDF)于2023-11-27）.

逻辑优化 (Chinese Wikipedia)

caltech.edu (Global: 887th place; Chinese: 966th place)

users.cms.caltech.edu

columbia.edu (Global: 488th place; Chinese: 823rd place)

academiccommons.columbia.edu

doi.org (Global: 2nd place; Chinese: 23rd place)

epfl.ch (Global: 4,521st place; Chinese: 2,540th place)