Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 1359 for “"Lower Bounds"”.
-
Lower Bounds and Derandomization
A major open problem in complexity theory is to determine whether randomized complexity classes such as BPP, AM, and MA have any nontrivial derandomization. This thesis investigates the derandomization of two randomized versions of the polynomial hierarchy.
-
Branching Program Lower Bounds
… time solution ? To begin, we prove exponential lower bounds on the size of a restricted model of branching programs called semantic read-once 3-ary nondeterministic branching programs solving a polytime computable function, in particular the polynomial evaluation problem. In the second part, we …
-
Lower Bounds for Generalized Regulators
… and Skoruppa demonstrated a method to derive lower bounds for the relative regulator of an extension L/K of number fields. The relative regulator is defined using the subgroup of relative units of L/K. It appears in the theta series associated to this subgroup, so an inequality relating the …
-
Lower bounds in distributed computing
… is well understood with tight upper and lower bounds. The connection with the maximum degree is much less well understood, with an exponential gap between the upper and lower bounds. We develop a new lower bound technique to give the first lower bound for a natural graph problem that is …
-
On learning from lower bounds
… and solidify known relationships between circuit lower bounds and algorithms for learning circuits. In particular, we present ways of converting Nisan's method of communication-complexity-based circuit lower bounds to algorithms for learning circuits with threshold gates. From this we obtain: A …
-
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures
… engines. The main emphasis of this thesis is on lower bounds for time-space tradeoffs for the following problems: the rank/select problem, the problem of representing a string of balanced parentheses, the text retrieval problem, the problem of computing a permutation and its inverse, and the …
-
Lower bounds for sparse recovery problems
… under various guarantees. We develop new lower bound techniques and show the tightness of existing results for the following variants of the sparse recovery problem: (i) adaptive sparse recovery, (ii) sparse recovery under high SNR, (iii) deterministic L2 heavy hitters, and, (iv) …
-
Unified Lower Bounds for Monotone Computation
… rank-based complexity measure for proving lower bounds on the monotone formula complexity of boolean functions. Later work by Gal showed that Razborov's rank measure also provides lower bounds on monotone switching networks, which measure space complexity, and monotone span programs, which …
-
Communication Lower Bounds via Query Complexity
The goal of this thesis is to prove lower bounds in communication complexity by exploiting new connections to query complexity. Our basic strategy is to first prove a general theorem stating that for a large class of communication problems F, any protocol for F can be efficiently simulated by a …
-
Automatically generated lower bounds for search
… algorithms (eg. A* and IDA*) with accurate lower bounds can solve impressively large problems optimally. Most lower bounds, such as the well known Manhattan Distance heuristic for the sliding-tile puzzles or the Assignment Problem lower bound for the Asymmetric Traveling Salesman problem, …
-
Lower bounds for integer programming problems
… To solve a minimization MIP problem, a lower bound is needed in a branch-and-bound algorithm to evaluate the quality of a feasible solution and to improve the efficiency of the algorithm. This thesis develops a new MIP model and studies algorithms for obtaining lower bounds for MIP. The …
-
Strong lower bounds on generic convex relaxations
… at decreasing this gap by proving unconditional lower bounds on powerful algorithmic techniques based on linear (LP) and semi-definite programming (SDP) for Planted Clique and Constraint Satisfaction problems (CSPs). Planted Clique is a central question in average case complexity where the goal …
-
Inherently quantum lower bounds on computational complexity
… we (1) introduce new tools for proving lower bounds on quantum query complexity augmented with quantum states and unitary transformations, (2) establish black-box separations in structural complexity that illustrate fundamental differences between classical and quantum randomness, and …
-
Lower Bounds and Algorithms for Searching Networks
… yet been revealed. In this thesis, we give new lower bounds on the fast search number. Using the new lower bounds, we prove an explicit formula for the fast search number of the cartesian product of an Eulerian graph and a path. We also give formulas for the fast search number of variants of the …
-
Some Upper and Lower Bounds regarding Query Complexity
… label detection problem by improving a classical lower bound technique; and we prove such a lower bound is nearly tight by giving a classical query algorithm whose query complexity matches the lower bound, up to a polylog factor.
-
THE CALCULATION OF LOWER BOUNDS TO ATOMIC ENERGIES.
… that enables one to calculate accurate, rigorous lower bounds to the eigenvalues of the standard nonrelativistic spin-free Hamiltonian for an atom with N electrons. Lower bounds are necessary in order to complement upper bounds obtained from the Hartree-Fock and Rayleigh-Ritz techniques. Without …
-
Lower Bounds for Interactive Compression and Linear Programs
This thesis proves concrete lower bounds related to two computational settings - interactive compression and linear programs. The first part of this thesis studies data compression in interactive models. In the classical setting of data compression, we have a sender that wishes to convey a message …
-
Lower bounds and correctness results for locally decodable codes
… Our most exciting contribution is an exponential lower bound on the length of three query LDCs (binary or linear) with high correctness. This is the first strong length lower bound for any kind of LDC allowing more than two queries. For LDCs allowing three or more queries, the previous best lower …
Page 1 of 68