16 citations · 106 across the 22 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.CC2014★ 1 cited
Instruction sequence size complexity of parity
J. A. Bergstra, C. A. Middelburg
Each Boolean function can be computed by a single-pass instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructio…
cs.LO2014★ 14 cited
On algorithmic equivalence of instruction sequences for computing bit string functions
J. A. Bergstra, C. A. Middelburg
Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only in…