Navin Goyal, Lower Bounds, Noisy Broadcast Problem
We prove the first non-trivial (superlinear) lower bound in the noisy broadcast model of distributed computation. In this model, there are n +1processors P0,P1,...,Pn. Each Pi, fori ≥ 1, initially...
This chapter describes the use of the function multicomp in the analysis of multiple comparisons. Section 17.1 describes simple calls to multicomp for standard comparisons in one-way layouts. Section...
MATHEMATICS OF COMPUTATION S 0025-5718(09)02211-X (2009)
Lower Bounds, For Z-numbers, Artūras Dubickas, J. Mossinghoff
Abstract. Let p/q be a rational noninteger number with p>q ≥ 2. A real number λ>0isaZ p/q-number if {λ(p/q) n} < 1/q for every nonnegative integer n, where{x} denotes the fractional part...
Cracks in the Defenses: Scouting Out Approaches on Circuit (2008)
Abstract. 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 “natural...
The Number of Recombination Events in a Sample History: Conflict Graph (2008)
Lower Bounds, Vineet Bafna, Vikas Bansal
Abstract—We consider the following problem: Given a set of binary sequences, determine lower bounds on the minimum number of recombinations required to explain the history of the sample, under the...
Navin Goyal, Lower Bounds, Noisy Broadcast Problem
We prove the first non-trivial (superlinear) lower bound in the noisy broadcast model of distributed computation. In this model, there are n +1processors P0,P1,...,Pn. Each Pi, fori ≥ 1, initially...
Efficient Learning Algorithms Yield Circuit (2008)
For C equal to polynomial-size, depth-two threshold circuits (i.e., neural networks with a polynomial number of hidden nodes), our result shows that efficient learning algorithms for this class would...
NETWORK ERROR CORRECTION, PART II: (2008)
Lower Bounds, Ning Cai, W. Yeung
Abstract. In Part I of this paper, we introduced the paradigm of network error correction as a generalization of classical link-by-link error correction. We also obtained the network generalizations...
Konrad-Zuse-Zentrum fu¨r Informationstechnik Berlin (2008)
Thomas Wolle, Hans L. Bodlaender, Degree-based Treewidth, Lower Bounds, Degree-based Treewidth, ...
Abstract. Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving...
Geometric Dilation of Closed Planar Curves: New (2008)
Lower Bounds, Annette Ebbers-baumann, Ansgar Grüne, Rolf Klein
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all pairs of points on...
T. Lang E. 6. Fernandez Improving the Computation of (2008)
Lower Bounds, Optimal Schedules
Abstract: Ways of decreasing the.number of operations needed to compute the lower bounds of optimal schedules, by reducing the number of time intervals that must be considered, are presented. The...
Graham Cormode, S. Muthukrishnan, Lower Bounds
– New approaches for this problem and its extensions. Some questions We see a large number of individual transactions (such as Amazon book sales) – What are the top sellers today? We are...
AND STOCHASTIC OPTIMIZATION ALGORITHMS FOR UNIFORM DESIGNS WITH THREE OR FOUR LEVELS (2008)
Lower Bounds, Kai-tai Fang, Dietmar Maringer, Yu Tang, Peter Winker
Abstract. New lower bounds for three- and four-level designs under the centered L2-discrepancy are provided. We describe necessary conditions for the existence of a uniform design meeting these lower...
Sparse Selfreducible Sets and Polynomial Size Circuit (2008)
Lower Bounds, Harry Buhrman, Leen Torenvliet
Abstract. It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely...
Lower Bounds, Graph Embeddings, Combinatorial Preconditioners, Gary L. Miller, Peter C. Richter
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and dilation of an...
Lower Bounds, Dieter Arnold, Ar Kavčić, Hans-andrea Loeliger, Pascal O. Vontobel, Wei Zeng
It has recently become feasible to compute information rates of finite-state source/channel models with not too many states. Such methods can also be used to compute upper and lower bounds on the...
One, Two, Three... Infinity: (2008)
Lower Bounds, Parallel Computation, Faith E. Fkb, Prabbakar Ragde
In this paper we compare the power of the two most commonly used concurrent-write models of parallel computation, the COMMON PRAM and the PRI-ORITY PRAM. These models d%er in the way they resolve...
Lower Bounds, Michael B. Pursley, Dilip Tr Sarwate, Senior Member, Wayne E. Stark, Student Member
Absrract-Upper and lower bounds on the average probability of error are obtained for direct-sequence spread-spectrum multipleaccess communications systems with additive white Gaussian noise channels....
Thomas Wolle, Hans L. Bodlaender, Degree-based Treewidth, Lower Bounds, ...
Abstract. Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving...
Lower Bounds, Michael B. Pursley, Dilip Tr Sarwate, Senior Member, Wayne E. Stark, Student Member
Absrract-Upper and lower bounds on the average probability of error are obtained for direct-sequence spread-spectrum multipleaccess communications systems with additive white Gaussian noise channels....
Kolmogorov complexity and formula size lower bounds (2008)
Troy Lee, Formula Size, Lower Bounds, Academisch Proefschrift, Troy Jeffrey Lee, Promotor Prof. Dr, ...
ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof.mr. P.F. van der Heijden ten overstaan van een door het college voor promoties...
and Time-Space Tradeoffs (2008)
Lower Bounds, Lower Bounds, Lower Bounds, Academisch Proefschrift, Prof. Dr. A. Schrijver, Bruce Lee
ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof.mr. P.F. van der Heijden ten overstaan van een door het college voor promoties...
Flows on Few Paths: Algorithms (2008)
Lower Bounds, Maren Martens, Martin Skutella
Abstract. Classical network flow theory allows decomposition of flow into several chunks of ar-bitrary sizes traveling through the network on different paths. In the first part of this paper we...
Submodular Approximation: Sampling-based Algorithms and (2008)
Lower Bounds, Zoya Svitkina, Lisa Fleischer
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular...
The MIT Press Volume 1999, Article 8 (2007)
Lower Bounds, Linear Satisfiability Problems, R Scisearch
Published one article at a time in L ATEX source form on the Internet. Pagination
Lower Bounds, Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Fur Informatik, ...
The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a...
for some geometric problems V. Sacrist'an (2007)
Lower bounds for some geometric problems Vera wrote it, but many did it
A New Protocol for Asymmetric Communication Channels: Reaching the (2007)
Lower Bounds, Shayan Ghazizadeh, Mohammad Ghodsi, Amin Saberi
In this paper we are concerned with the problem of sending n-bit of data from a client to a server using an asymmetric communication channel where the line bandwidth from server to client is much...
Estimating Univariate Black Box Functions with (2007)
Upper And Lower, Lower Bounds, Zelda B. Zabinsky, Robert L. Smith, Birna P. Kristinsdottir
A procedure to estimate a univariate Lipschitz continuous function and provide upper and lower bounds is given in this paper. The procedure evaluates the function at the midpoint of the interval with...
Geometric Dilation of Closed Planar Curves: New Lower Bounds (2006)
Lower Bounds, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all pairs of points on...
Really Straight Graph Drawings (2004)
Vida Dujmovic, Matthew Suderman, David R. Wood, Lower Bounds
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees....
Thomas Wolle Hans, Hans L. Bodlaender, Degree-based Treewidth, Lower Bounds, ...
Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower...
Flows on Few Paths: Algorithms and Lower Bounds (2004)
Lower Bounds, Maren Martens, Martin Skutella
In classical network flow theory, flow being sent from a source to a destination may be split into a large number of chunks traveling on different paths through the network. This effect is undesired...
to the sorting problem. First note that many sorting algorithms, such as insertion-sort, merge-sort, heapsort, and quicksort, are comparison based. Fakultat fur Informatik,...
The Computational Complexity Column (1998)
Eric Allender Rutgers, Eric Allender, Lower Bounds
ega\Gamma n) to compute, and also requires circuit size 2 \Omega\Gamma n) . This still doesn't tell me that I won't be able to compute f for my application. I'm never going to need 1...
Lower Bounds, Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
et al.: Trans-Dichotomous
Reducing the complexity (1997)
c○Springer-Verlag Abstract. This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded...
Trans-Dichotomous Algorithms without Multiplication (1997)
Lower Bounds, Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro, Andrej Brodnik, Peter Bro Miltersen, ...
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...
S. T. Mccormick, M. Queyranne, Lower Bounds, ...
. There has been recent success in using polyhedral formulations of scheduling problems not only to obtain good lower bounds in practice but also to develop provably good approximation algorithms....
Fast Exponentiation with Precomputation: Algorithms and Lower Bounds (1995)
Lower Bounds, Ernest F. Brickell, Daniel M. Gordon, Kevin S. Mccurley, David B. Wilson
In several cryptographic systems, a fixed element g of a group of order N is repeatedly raised to many different powers. In this paper we present a practical method of speeding up such systems, using...
Lower bounds for the quadratic semiassignment problem (1995)
Federico Malucelli, Daniele Pretolani, Keywords Quadratic, Semi-assignment Problem, Lower Bounds
Abstract: In this paper we will present class of new lower bounds for the Quadratic Semi-Assignment Problem (QSAP). These bounds are based on recent results about polynomially solvable cases, in...
Finite Limits and Lower Bounds for Circuits Size (1994)
Stasys Jukna Finite, Mathematik Informatik, Trierer Forschungsberichte, Fachbereich Iv, Finite Limits, Lower Bounds, ...
. The lower bounds problem in circuit complexity theory may be looked as the problem about the possibility to diagonalize over finite sets of computations. Our goal here is to show that Sipser's...
Finite Limits and Lower Bounds for Circuits Size (1994)
Mathematik Informatik, Trierer Forschungsberichte, Fachbereich Iv, Finite Limits, Lower Bounds, Stasys Jukna, ...
. The lower bounds problem in circuit complexity theory may be looked as the problem about the possibility to diagonalize over finite sets of computations. Our goal here is to show that Sipser's...
New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract) (1992)
Lower Bounds, Eugène Van Heijst, Torben Pryds Pedersen, Birgit Pfitzmann
) Eugène van Heijst 1 , Torben Pryds Pedersen 2 , Birgit Pfitzmann 3 Abstract. With a fail-stop signature scheme, the supposed signer of a forged signature can prove to everybody else that it was a...
[2] D. R. Brillinger, Time Series, Data Analysis and Theory. San Francisco, (1992)
O. Shalvi, E. Weinstein, Maximum Likelihood, Lower Bounds
term in (A.12) be negligible compared with (35), we must further require that @„af P A � 0 af approaches zero. This rather unusual requirement simply assures that the modeling errors (bias...
This chapter describes the use of the function multicomp in the analysis of multiple comparisons. Section 17.1 describes simple calls to multicomp for standard comparisons in one-way layouts. Section...