Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
kragen
on June 17, 2019
|
parent
|
context
|
favorite
| on:
Universal Logic Gates (2015)
In the set-containment lattice, neither {AND, XOR} nor {NAND} is "larger than" the other, so they are both minimum covers.
OJFord
on June 17, 2019
[–]
Agh, yes, you're absolutely right. Been too long :(
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
