120 search results - page 7 / 24 » siamcomp 2008 |
SIAMCOMP
2000
14 years 11 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...
SIAMCOMP
2000
14 years 11 months ago
2000
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
SIAMCOMP
2000
14 years 11 months ago
2000
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model. This is a fundamental problem in c...
101
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
SIAMCOMP
2008
14 years 11 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...