Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk)
نویسنده
چکیده
We discuss open questions around worst case time and space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior.
منابع مشابه
Faster and Space Efficient Exact Exponential Algorithms: Combinatorial and Algebraic Approaches
Exponential algorithms, whose time complexity is O(c) for some constant c > 1, are inevitable when exactly solving NP-complete problems unless P = NP. This chapter presents recently emerged combinatorial and algebraic techniques for designing exact exponential time algorithms. The discussed techniques can be used either to derive faster exact exponential algorithms, or to significantly reduce t...
متن کاملInvited talk: Algorithms for Geometric Similarity
A basic problem in classifying, or searching for similar objects in, a large set of geometric objects is computing similarity between two objects. This has led to extensive work on computing geometric similarity between two objects. This talk discusses some old and some new geometric-similarity algorithms, with an emphasis on transportation distance (also called earth mover’s distance) and Frec...
متن کاملLagrangian Relaxation for Inference in Natural Language Processing
There has been a long history in combinatorial optimization of methods that exploit structure in complex problems, using methods such as dual decomposition or Lagrangian relaxation. These methods leverage the observation that complex inference problems can often be decomposed into efficiently solvable sub-problems. Thus far, however, these methods are not widely used in NLP. In this talk I will...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملConvexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk)
In this high level and accessible talk I will describe a recent line of works aimed at trying to understand the intrinsic complexity of computational problems by finding optimal algorithms for large classes of such problems. In particular, I will talk about efforts centered on convex programming as a source for such candidate algorithms. As we will see, a byproduct of this effort is a computati...
متن کامل