SIAMCOMP
2000
13 years 4 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
SIAMCOMP
2000
13 years 4 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
SIAMCOMP
2000
13 years 4 months ago
2000
In this paper, we reexamine in the framework of robust computation the Bentley
SIAMCOMP
2000
13 years 4 months ago
2000
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
SIAMCOMP
2000
13 years 4 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
SIAMCOMP
2000
13 years 4 months ago
2000
The main result is a finite-state version of the Kraft
SIAMCOMP
2000
13 years 4 months ago
2000
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
SIAMCOMP
2000
13 years 4 months ago
2000
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
SIAMCOMP
2000
13 years 4 months ago
2000
We consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in R3 such that the aspect...