Sciweavers

3208 search results - page 26 / 642
» A Lower Bound for Primality
Sort
View
ECCC
2010
90views more  ECCC 2010»
13 years 7 months ago
A note on circuit lower bounds from derandomization
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales b...
Scott Aaronson, Dieter van Melkebeek
EOR
2006
104views more  EOR 2006»
13 years 7 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve
COMBINATORICS
2000
87views more  COMBINATORICS 2000»
13 years 7 months ago
Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers
We give new lower bounds for the Schur numbers S(6) and S(7). This will imply new lower bounds for the Multicolor Ramsey Numbers R6(3) and R7(3). We also make several observations...
Harold Fredricksen, Melvin M. Sweet
TIT
2010
111views Education» more  TIT 2010»
13 years 2 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
IPL
2011
94views more  IPL 2011»
12 years 11 months ago
Lower bounds for context-free grammars
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
Yuval Filmus