4,506
edits
(→Boolean optimization: Clarify that SIMD ISAs are less convenient for boolean algorithms) |
|||
Line 99: | Line 99: | ||
* [[Bob Smith]], [http://www.sudleyplace.com/APL/boolean.pdf "Boolean Functions"] | * [[Bob Smith]], [http://www.sudleyplace.com/APL/boolean.pdf "Boolean Functions"] | ||
* Jonathan Barman, [http://archive.vector.org.uk/trad/v011/barman011_127.pdf APL and Partitioned Data] (a follow-up on Smith's paper) | |||
* [[Eugene McDonnell]], [https://www.jsoftware.com/papers/eem/caret.htm "The Caret and the Stick Functions"] (on classifying Boolean functions). | * [[Eugene McDonnell]], [https://www.jsoftware.com/papers/eem/caret.htm "The Caret and the Stick Functions"] (on classifying Boolean functions). | ||
* [[Phil Last]], [http://archive.vector.org.uk/art10501140 "Boolean Reductions"] | * [[Phil Last]], [http://archive.vector.org.uk/art10501140 "Boolean Reductions"] |