Results 1 - 10 of 46,174

Robustness of PSPACE-complete sets

by A. Pavan , Fengming Wang , 2008
"... We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXP-complete sets [3] and NP-complete sets [7]. ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXP-complete sets [3] and NP-complete sets [7].

On the Structure of Complete Sets

by Harry Buhrman, Leen Torenvliet - IN PROCEEDINGS 9TH STRUCTURE IN COMPLEXITY THEORY , 1994
"... The many types of resource bounded reductions that are both object of study and research tool in structural complexity theory have given rise to a large variety of completeness notions. A complete set in a complexity class is a manageable object that represents the structure of the entire class. The ..."
Abstract - Cited by 19 (1 self) - Add to MetaCart
The many types of resource bounded reductions that are both object of study and research tool in structural complexity theory have given rise to a large variety of completeness notions. A complete set in a complexity class is a manageable object that represents the structure of the entire class

Properties of NP-complete sets

by Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta - In Proceedings of the 19th IEEE Conference on Computational Complexity , 2004
"... We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S � ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP. We demonstrate existence of a sparse set S ∈ DTIME(22n) such that for every L ∈ NP − P, L − S is not ≤p m-hard for NP. Moreo ..."
Abstract - Cited by 7 (7 self) - Add to MetaCart
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S � ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP. We demonstrate existence of a sparse set S ∈ DTIME(22n) such that for every L ∈ NP − P, L − S is not ≤p m-hard for NP

SPLITTING NP-COMPLETE SETS

by Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang , 2006
"... We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕ ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: NP, coNP, â

Almost Complete Sets

by Klaus Ambos-spies, Wolfgang Merkle, Jan Reimann, Sebastiaan A. Terwijn , 2000
"... . We show that there is a set which is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2 lin . Here a set A in a complexity class C is almost complete for C under some reducibility r if the class of the p ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
. We show that there is a set which is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2 lin . Here a set A in a complexity class C is almost complete for C under some reducibility r if the class

Exact Matrix Completion via Convex Optimization

by Emmanuel J. Candès, Benjamin Recht , 2008
"... We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfe ..."
Abstract - Cited by 873 (26 self) - Add to MetaCart
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can

A Singular Value Thresholding Algorithm for Matrix Completion

by Jian-Feng Cai, Emmanuel J. Candès, Zuowei Shen , 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract - Cited by 555 (22 self) - Add to MetaCart
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task

Unions of Disjoint NP-Complete Sets

by Christian Glaßer, John M. Hitchcock, A. Pavan, Stephen Travers
"... We study the following question: if A and B are disjoint NP-complete sets, then is A ∪ B NP-complete? We provide necessary and sufficient conditions under which the union of disjoint NP-complete sets remain complete. ..."
Abstract - Add to MetaCart
We study the following question: if A and B are disjoint NP-complete sets, then is A ∪ B NP-complete? We provide necessary and sufficient conditions under which the union of disjoint NP-complete sets remain complete.

Redundancy in Complete Sets

by Christian Glaßer , A. Pavan, Alan L. Selman, Liyu Zhang , 2005
"... ... We disprove the equivalence between autoreducibility and mitoticity for all polynomialtime-bounded reducibilities between 3-tt-reducibility and Turing-reducibility: There exists a sparse set in EXP that is polynomial-time 3-tt-autoreducible, but not weakly polynomial-time T-mitotic. In particula ..."
Abstract - Cited by 8 (6 self) - Add to MetaCart
... We disprove the equivalence between autoreducibility and mitoticity for all polynomialtime-bounded reducibilities between 3-tt-reducibility and Turing-reducibility: There exists a sparse set in EXP that is polynomial-time 3-tt-autoreducible, but not weakly polynomial-time T

The SimpleScalar tool set, version 2.0

by Doug Burger, Todd M. Austin - Computer Architecture News , 1997
"... This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and high-performance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces, bette ..."
Abstract - Cited by 1844 (43 self) - Add to MetaCart
, better documentation, easier installation, improved portability, and higher performance. This report contains a complete description of the tool set, including retrieval and installation instructions, a description of how to use the tools, a description of the target SimpleScalar architecture, and many
Results 1 - 10 of 46,174