Seminar Details
Minimal Circuits for Boolean Functions
- Start Date: April 13, 2022
- Event Start Time: 12:15 PM
- Event End Time: 1:15 PM
- Seminar Series: Graduate Combinatorics Seminar
- Presenter(s): Blair Seidler - Rutgers University
- Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
- Event Additional Info: <p><strong>This seminar is being held in person in The Hill Center,<br /> Mathematics Graduate Student Lounge - 7th Floor<br /> and online via a simultaneous broadcast on Zoom.</strong><br /> Zoom Link: <a href="https://rutgers.zoom.us/j/93463091604?pwd=Lzh2THR1NTM0b0tkaktScEVpYkt1dz09" target="_blank">https://rutgers.zoom.us/j/93463091604?pwd=Lzh2THR1NTM0b0tkaktScEVpYkt1dz09</a></p> <p>Meeting ID: 934 6309 1604</p> <p>Password: 442017</p>
- Presentation Type: Stand Alone Presentation
- Abstract:
How would one use Maple to produce a catalog of minimum-complexity circuits for all Boolean functions of a small number of variables? This talk will focus on the modeling decisions and optimizations (successful and otherwise) of that process. Planned digression #1 is a discussion of the Quine-McCluskey algorithm for minimization of Boolean functions. Planned digression #2 will demonstrate the relationship between the number of antichains of subsets of [n] and the number of monotone Boolean functions.