Semantic Scholar uses AI to extract papers important to this topic.
Nonnegative matrix factorization (NMF) has become a prominent technique for the analysis of image databases, text databases, and… Expand Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is… Expand We introduce a new low-degree-test, one that uses the restriction of low-degree polynomials to planes (i. e., afine sub-spaces of… Expand Computational complexity is the study of the difficulty of solving computational problems, in terms of the required computational… Expand 1. Mathematical Preliminaries. 2. Elements of Computability Theory. 4. The Class P. 5. The Glass NP. 6. The Complexity of… Expand We define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of optimization problems, and in… Expand It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are easy to solve; so that… Expand Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module… Expand We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity… Expand The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand