Descriptive Complexity, Lower Bounds and Linear Time
نویسنده
چکیده
This paper surveys two related lines of research: Logical characterizations of (non-deterministic) linear time complexity classes, and non-expressibility results concerning sublogics of existential second-order logic. Starting from Fagin's fundamental work there has been steady progress in both elds with the eeect that the weakest logics that are used in characterizations of linear time complexity classes are closely related to the strongest logics for which inexpressibility proofs for concrete problems have been obtained. The paper sketches these developments and highlights their connections as well as the obstacles that prevent us from closing the remaining gap between both kinds of logics.
منابع مشابه
Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes
Proving lower bounds remains the most difficult of tasks in computational complexity theory. In this paper, we show that whereas most natural NP-complete problems belong to NLIN (linear time on nondeterministic RAMs), some of them, typically the planar versions of many NP-complete problems are recognized by nondeterministic RAMs in linear time and sublinear space. The main results of this paper...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملLower Bounds on the Information Ratio of Linear Secret Sharing Schemes
Superpolynomial lower bounds on the average information ratio of linear secret sharing scheme are presented in this note for the first time. The previously known superpolynomial lower bounds applied only to the average information ratio of linear schemes in which the secret is a single field element. The new bounds are obtained by a simple adaptation of the techniques in those previous works.
متن کاملRefined Upper and Lower Bounds for 2-SUM
We prove upper and lower bounds on the time complexity of solving the 2-SUM problem: given a set of numbers, are there two of them that sum to zero? Our basic models are the linear decision tree and the degree-d algebraic decision tree. Our bounds are more precise than is common for this field and allow us to observe that 2-SUM is strictly harder than sorting in the linear decision tree model.
متن کامل6 ( a ) . Applications to auctions and linear programming
We have seen some basic protocols and lower bounds in communication complexity, and some of their applications to VLSI Design, time-space tradeoffs in the Turing machine model, streaming algorithms, and depth lower bounds for monotone circuits. We will continue in the same spirit and see two more applications of communication complexity. The agenda for today’s lecture is as follows: We will stu...
متن کامل