We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
Maria-Florina Balcan, Steve Hanneke, Jennifer Wort...
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...
Vladimir V. Lukin, Sergey K. Abramov, Nikolay N. P...