Some combinatorial-algebraic problems from complexity theory
نویسندگان
چکیده
منابع مشابه
On the Computational Complexity of some problems from Combinatorial Geometry
We study several canonical decision problems that arise from the most famous theorems from combinatorial geometry. We show that these are W[1]-hard (and NP-hard) if the dimension is part of the input by fpt-reductions (which are actually ptime-reductions) from the d-Sum problem. Among others, we show that computing the minimum size of a Caratheodory set and a Helly set and certain decision vers...
متن کاملSome Problems in Combinatorial Number Theory
We state and discuss various problems in the general area of arithmetic combinatorics and recent developments related to the ‘sum-product phenomenon’ in the ring of integers, the real and complex numbers and finite fields. In particular, we discuss applications and connections to the theory of exponential sums, Burgess’ estimate, the subspace theorem and to Szemeredi-Trotter type results. In re...
متن کاملInfinite Versions of Some Problems From Finite Complexity Theory
Recently, several authors have explored the connections between NP-complete problems for finite objects and the complexity of their analogs for infinite objects. In this paper, we will categorize infinite versions of several problems arising from finite complexity theory in terms of their recursion theoretic complexity and proof theoretic strength. These infinite analogs can behave in a variety...
متن کاملComplexity issues in some clustering problems in combinatorial circuits
The modern integrated circuit is one of the most complex products that has been engineered to-date. It continues to grow in complexity as the years progress. As a result, very large-scale integrated (VLSI) circuit design now involves massive design teams employing state-of-the art computer-aided design (CAD) tools. One of the oldest, yet most important CAD problems for VLSI circuits is physical...
متن کاملSome Problems in Proof Complexity and Combinatorial Optimization
Lovász and Schjriver [34] introduced several lift and project methods for 0-1 integer programs, now collectively known as Lovász-Schjriver (LS) hierarchies. Several lower bounds have since been proven for the rank of various linear programming relaxations in the LS hierarchy. In this paper we study lower bounds on the rank in the more general LS∗ hierarchy, which was first investigated by Grigo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00115-y