Critical infrastructures are interconnected on multiple levels, and due to their size models with acceptable computational complexity and adequate modeling capacities must be devel...
— In recent years, many people have been trying to develop some applications to information processing by exploiting oscillatory phenomena in neural networks. Bifurcation and sta...
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...