We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
In this paper, we present a novel entropy estimator for a given set of samples drawn from an unknown probability density function (PDF). Counter to other entropy estimators, the e...
A quantum device simulating human decision making process is introduced. It consists of quantum recurrent nets generating stochastic processes which represent the motor dynamics, ...
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...