Results 1 to 10 of about 871,220 (194)
Generic hardness of the Boolean satisfiability problem
AbstractIt follows from the famous result of Cook about the NP-completeness of the Boolean satisfiability problem that there is no polynomial algorithm for this problem ...
Alexander Rybalov
exaly +4 more sources
Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedups [PDF]
Rydberg atom arrays are among the leading contenders for the demonstration of quantum speedups. Motivated by recent experiments with up to 289 qubits [Ebadi et al., Science 376, 1209 (2022)0036-807510.1126/science.abo6587], we study the maximum ...
Ruben S. Andrist +11 more
doaj +2 more sources
Generic hardness of inversion on ring and its relation to self-bilinear map
In this paper, we study the generic hardness of the inversion problem on a ring, which is a problem to compute the inverse of a given prime c by just using additions, subtractions and multiplications on the ring.
Takashi Yamakawa +2 more
exaly +2 more sources
Post-marketing quality assessment of some brands of rosuvastatin tablets available in Jos, North-Central Nigeria [PDF]
Rosuvastatin is a synthetic statin medication approved for the management of lipid disorders and also for preventing cardiovascular disease in at-risk individuals.
Ukpe Ajima +4 more
doaj +2 more sources
Background: While generic drugs and branded drugs are supposed to be bioequivalent, generic drugs have the additional benefit of being available at a lower cost which can be important in patients with chronic diseases such as hypertension. However, there
Sudhir Pawar +7 more
doaj +2 more sources
On the concrete hardness of Learning with Errors
The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE.
Albrecht Martin R. +2 more
doaj +2 more sources
Generic Expression Hardness Results for Primitive Positive Formula Comparison [PDF]
We study the expression complexity of two basic problems involving the comparison of primitive positive formulas: equivalence and containment. We give two generic hardness results for the studied problems, and discuss evidence that they are optimal and ...
Hubie Chen +2 more
exaly +2 more sources
Generic Decoding in the Sum-Rank Metric
We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank metric.
Sven Puchinger +2 more
exaly +2 more sources
Quality Control Study of Different Products from Famotidine Tablets in the Iraqi Market
Background: In developing countries, particularly in Iraq, the use of generic medicines has been increasing in recent years, primarily as a cost-saving measure in healthcare provision.
Nizar Jassem
doaj +1 more source
A generic approach to proving NP-hardness of partition type problems
Mikhail Y Kovalyov, Erwin Pesch
exaly +2 more sources

