Results 251 to 260 of about 369,293 (294)
Complete genome sequence of BLRI-developed inactivated avian influenza A/H9N2 vaccine strain in Bangladesh. [PDF]
Microbiol Resour AnnouncSamad MA +5 more
europepmc +1 more source
Quality of adverse drug reaction reports submitted to the national pharmacovigilance center of Nepal: a pre- and post-training evaluation. [PDF]
BMC Med EducNepal S +8 more
europepmc +1 more source
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]
Theory Comput SystBentert M, Fomin FV, Golovach PA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Separation of NP-Completeness Notions
SIAM Journal on Computing, 2001Summary: 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.
Alan Louis Selman, A Pavan
exaly +4 more sources
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 +3 more sources
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 +3 more sources
Cryptocomplexity and NP-completeness
1980In 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 +2 more sources
Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
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