Sciweavers

3208 search results - page 22 / 642
» A Lower Bound for Primality
Sort
View
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
13 years 11 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
CSR
2008
Springer
13 years 9 months ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
Eric Allender
FOSSACS
2008
Springer
13 years 9 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
EOR
2006
83views more  EOR 2006»
13 years 7 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
JGAA
1998
116views more  JGAA 1998»
13 years 7 months ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl