Suchergebnisse - Bshouty, Nader H.

Lower bounds for algebraic computation trees of functions with finite domains

The direct sum conjecture in the straight line model

On the 2 x 2 matrix multiplication

Multiplicative complexity of direct sum of quadratic systems

Lower bounds for the complexity of functions in random access machines

Vector sets for exhaustive testing of logic circuits

Maximal rank of mxnx(m n-k) tensors

A lower bound for matrix multiplication

Generalizations of the normal basis theorem of finite fields

Algorithmic learning theory: [dedicated to the 23rd International Conference on Algorithmic Learning Theory (ALT 2012), held in Lyon, France, October 29-31, 2012]