Talk:Logic optimization
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||
 | The contents of the Circuit minimization for Boolean functions page were merged into Logic optimization on 14 September 2017. For the contribution history and old versions of the redirected page, please see its history; for the discussion at that location, see its talk page. |
Basically the same or a substantial sub-topic of this. Neither article has much depth/quality, but this one has a better outline (and the other one some kind of example) hence the proposed merge direction. 86.127.138.234 (talk) 06:31, 13 February 2015 (UTC)
I agree, I believe it is also necessary to common methods for optimizing & simplifying the circuits, and as this article states "under one or more specified constraints", how these constraints affect the circuit. For example, say you only have access to and/xor/xnor gates each with different delays, however, with circuits with specifications like this, the only way I know of doing this is by brute force to find the circuit with the least delay. Zombiedude347 (talk) 06:23, 10 November 2015 (UTC)
- Weak agree from me. These are discussed from the point of view of two quite different disciplines, but perhaps it is helpful to have these different perspectives represented on one page. Therefore, given the consensus,
Done Klbrain (talk) 11:21, 14 September 2017 (UTC)
External links modified
editHello fellow Wikipedians,
I have just modified one external link on Logic optimization. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
- Added archive https://web.archive.org/web/20170413153443/https://www.rrze.fau.de/wir-ueber-uns/kooperationen/iser.shtml to https://www.rrze.fau.de/wir-ueber-uns/kooperationen/iser.shtml
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
An editor has reviewed this edit and fixed any errors that were found.
- If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
- If you found an error with any archives or the URLs themselves, you can fix them with this tool.
Cheers.—InternetArchiveBot (Report bug) 06:29, 5 January 2018 (UTC)
Self-links
editAll the links in https://en.wikipedia.org/wiki/Logic_optimization#Graphical_logic_minimization_methods just redirect back to themselves. Can we either
1. Delete the redirects and allow them to become articles 2. Delete the links?
— Omegatron (talk) 21:01, 6 April 2021 (UTC)
- Done I deleted the links. When someone turns a redirect into an article, during its de-orphanization the occurrence here will be found, and turned into a link again, I hope. - Jochen Burghardt (talk) 09:10, 7 April 2021 (UTC)
Encyclopedia article vs literature search
editAn encyclopedia article should give a concise overview of a topic. A list of hundreds of links to journals and obscure literature is only bewildering to the reader and explains nothing. There are plenty of books on lists of publications about logic minimization, we serve no-one by duplicating that here. The list is no guide to the new user on "which of these primary sources are meaningful to an understanding of this topic", and which are just Professor Kropotkin grinding out publications to meet his tenure goal. --Wtshymanski (talk) 03:20, 31 May 2022 (UTC)