On computational complexity of non-reducible descriptors | IEEE Conference Publication | IEEE Xplore