Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
نویسندگان
چکیده
منابع مشابه
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
Let K be an infinite field. We give polynomial time constructions of families of r-dimensional subspaces of Kn with the following transversality property: any linear subspace of Kn of dimension n− r is transversal to at least one element of the family. We also give a new NP-completeness proof for the following problem: given two integers n and m with n m and a n ×m matrix A with entries in Z, d...
متن کاملContractibility and NP-completeness
For a fixed graph H, let H-CON denote the problem of determining whether a given graph is contractible to H. The complexity of H-CON is studied for H belonging to certain classes of graphs, together covering all connected graphs of order at most 4. In particular, H-CON is NP-complete if H is a connected triangle-free graph other than a star. For each connected graph H of order a t most 4 other ...
متن کاملBroadcasting and NP - completeness
In this note, we answer two questions arising in broadcasting problems in networks. We rst describe a new family of minimum broadcast graphs. Then we give a proof due to Alon of the NP-completeness of nding disjoint spanning trees of minimum depth, rooted at a given vertex.
متن کاملNP-Completeness and Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A,B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provi...
متن کاملTuring Machines , P , NP and NP - completeness
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2003
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-002-0076-4