Talk:Logic optimization

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

Talk:Logic optimization

Circuit minimization for Boolean functions

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)Reply

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)Reply

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)Reply

Hello 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:

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

checkY 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)Reply

All 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)Reply

 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)Reply

Encyclopedia article vs literature search

An 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)Reply

Redirects to article do not have their content in the article

There are many redirects to this page (such as the article McCalla minterm-ring map) which redirected to a pile of sources about this - not great, but at least something.

After @Wtshymanski's cleanup of the page, the topic of the original article is nowhere to be found. Given that a proper description of all such topics seems infeasible (seeing as they got deleted and not expanded) removing the redirects might be required.

-FavoritoHJS (talk) 17:46, 28 October 2025 (UTC)Reply

Go for it. Be Bold used to be our motto. --Wtshymanski (talk) 15:33, 2 November 2025 (UTC)Reply

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.