We completely solve the problem of enumerating combinatorially inequivalent d-dimensional polytopes with d + 3 vertices. A first solution of this problem, by Lloyd, was published ...
Errors in estimating page counts can lead to poor choice of access methods and in turn to poor quality plans. Although there is past work in using execution feedback for accurate c...
Surajit Chaudhuri, Vivek R. Narasayya, Ravishankar...
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...