top | item 44327756

Minimal Boolean Formulas (2011)

103 points| mcyc | 8 months ago |research.swtch.com

19 comments

order

Sharlin|8 months ago

The standard Floyd–Warshall is fairly easily parallelizable. I wonder how fast you could solve this problem with today's GPUs, and whether a(6) might be attainable in some reasonable time.

dooglius|8 months ago

Could one do this directly with transistors or standard cells? Seems very useful for ASICs, particularly structured ASICs which are mapped from FPGA lookup tables of size 4-6.

o11c|8 months ago

This isn't quite as useful in practice as it seems, since NOT isn't always free, you almost always can eliminate common subexpressions, and gates with more than two inputs are often cheaper than doing everything with two-input gates.

lilyball|8 months ago

The example parity function for 3 variables appears to be flipped. Instead of being true if the number of true inputs is odd, it's true if the number of true inputs is even.

fallat|8 months ago

How is Russ so f'ing cracked. The brain on this human. 99.9% of us will never touch his intelligence.

cluckindan|8 months ago

Using the * operator for AND is very non-standard. Unicode provides ¬ for negation, ∧ for conjunction and ∨ for disjunction. These are commonly used in CS literature, along with bar(s) over variables or expressions to denote negation, which are definitely a mixed bag for readability.

dse1982|8 months ago

Isn't the AND operation often represented using multiplication notation (dot or star) because it is basically a boolean multiplication?

bee_rider|8 months ago

It is not so uncommon to see it represented by a dot. I guess a star is like a dot, but doesn’t require finding any weird keys. It isn’t ideal but it is obvious enough what they mean.