Results 271 to 280 of about 272,983 (311)

Benchmarking informatics workflows for data-independent acquisition single-cell proteomics. [PDF]

Nat Commun
Wang J, Huang Y, Lu F, Xu Q, Yang Z, Jiang Y, Shi S, Pan J, Yang Y, Fang Q.   +9 more
europepmc   +1 more source

Progress in Natural Products Target Discovery Technology. [PDF]

MedComm (2020)
Pan Q, Yuan X, Jin J, Luan X, Luo C, Chen H, Zhang W, Zhang H.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Separation of NP-Completeness Notions

SIAM Journal on Computing, 2001
Summary: We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is \({\leq}^P_T\)-complete but not \({\leq}^P_{tt}\)-complete. We provide fairly thorough analyses of the hypotheses that we introduce.
A Pavan, Alan L Selman
exaly   +3 more sources

The NP-completeness column

ACM Transactions on Algorithms, 2005
This is the 24th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., New York, 1979, hereinafter referred to as “[G&J].”” Previous
David S Johnson
exaly   +2 more sources

Hashiwokakero is NP-complete

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Cryptocomplexity and NP-completeness

1980
In view of the known difficulty in solving NP-hard problems, a natural question is whether there exist cryptosystems which are NP-hard to crack. In Section I we display two such systems which are based on the knapsack problem. However, the first one, which is highly "linear" has been shown by Lempel to be almost always easy to crack. This shows that NP-
Shimon Even, Yacov Yacobi
openaire   +1 more source

Minesweeper is NP-complete

The Mathematical Intelligencer, 2000
NP-completeness Many programming p rob lems require the design of an algor i thm which has a "yes" or "no" ou tput for each input. For example , the p rob lem of test ing a whole number for pr imal i ty requires an a lgor i thm which answers "yes" if the input number x is prime, and "no" otherwise.
openaire   +1 more source

On the NP-completeness of cryptarithms

ACM SIGACT News, 1987
If we only consider problems with decimal numbers as above there is no possibility of any hardness result, because there are only 10! different assignments of digits and letters to try. Therefore we will generalize the problem slightly: the base of representation for our numbers will be given as part of the problem (expressed in unary or binary) rather
openaire   +1 more source

Properties of NP-complete sets

Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., 2004
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S \not\supseteq L is a p-selective sparse set, then L - S is \leq pm-hard for NP. We demonstrate the existence of a sparse set S \in DTIME(22n) such that for every L \in NP - P, L - S is not \leq pm-hard for NP.
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta   +3 more
openaire   +2 more sources