Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IPL
2002
118views more  IPL 2002»
10 years 11 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
IPL
2002
107views more  IPL 2002»
10 years 11 months ago
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
Sunil Arya
DAM
1998
88views more  DAM 1998»
10 years 11 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
SIAMDM
2000
69views more  SIAMDM 2000»
10 years 11 months ago
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
Jaikumar Radhakrishnan, Amnon Ta-Shma
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
10 years 11 months ago
On Interpolation and Automatization for Frege Systems
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 ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
SIAMCOMP
2000
86views more  SIAMCOMP 2000»
10 years 11 months ago
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
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...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
PAAPP
2000
118views more  PAAPP 2000»
10 years 11 months ago
Processor-time-optimal systolic arrays
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
Peter R. Cappello, Ömer Egecioglu, Chris J. S...
MOC
2000
69views more  MOC 2000»
10 years 11 months ago
Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions
Lower bounds for the condition numbers of the preconditioned systems are obtained for the Bramble-Pasciak-Schatz substructuring preconditioner and the Neumann-Neumann preconditione...
Susanne C. Brenner, Li-Yeng Sung
ECCC
2002
103views more  ECCC 2002»
10 years 11 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
EJC
2000
10 years 11 months ago
On Intersection Sets in Desarguesian Affine Spaces
Lower bounds on the size of t-fold blocking sets with respect to hyperplanes or t-intersection sets in AG(n, q) are obtained, some of which are sharp.
Simeon Ball
books