Abstract. In this note we report the following computational results on partial spread functions in 8 variables: (i) the numbers of equivalence classes of partial spread functions ...
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
These lecture notes cover several topics such as Optimization, Technology and profit maximization, Profit maximization and cost minimization, The cost function & duality, Consu...
We examine Dubois's [Dubois, D., 2003. Mathematical foundations of discrete and functional systems with strong and weak anticipations. Lecture Notes in Computer Science 2684,...