Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...
Classes of set functions defined by the positivity or negativity of the higher-order derivatives of their pseudo-Boolean polynomial representations generalize those of monotone, supermodular, and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback