Results 41 to 50 of about 872,020 (326)
New Generic Algorithms for Hard Knapsacks [PDF]
, 2010 In this paper, we study the complexity of solving hard knapsack problems, i.e., knapsacks with a density close to 1 where lattice-based low density attacks are not an option. For such knapsacks, the current state-of-the-art is a 31-year old algorithm by Schroeppel and Shamir which is based on birthday paradox techniques and yields a running time of ...
Nick Howgrave-Graham, Antoine Joux
openaire +2 more sources
Adversarial Diversity and Hard Positive Generation [PDF]
2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), 2016 State-of-the-art deep neural networks suffer from a fundamental problem - they misclassify adversarial examples formed by applying small perturbations to inputs. In this paper, we present a new psychometric perceptual adversarial similarity score (PASS) measure for quantifying adversarial images, introduce the notion of hard positive generation, and ...
Andras Rozsa +2 more
openaire +2 more sources
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions [PDF]
, 2020 Despite the fundamental importance of delay functions, repeated squaring in RSA groups (Rivest, Shamir and Wagner \u2796) is the main candidate offering both a useful structure and a realistic level of practicality.
Gil Segev, Lior Rotem
core +1 more source
Automated analysis of cryptographic assumptions in generic group models [PDF]
, 2014 . We initiate the study of principled, automated, methods for analyzing hardness assumptions in generic group models, following the approach of symbolic cryptography.
Benedikt Schmidt +5 more
core +1 more source
Hardness of the generalized coloring numbers
European Journal of Combinatorics17 pages, 4 ...
Michael Breen-McKay +2 more
openaire +2 more sources
Generating Hard Problems of Cellular Automata
CoRR, 2022 We propose two hard problems in cellular automata. In particular the problems are: [DDP$^M_{n,p}$] Given two \emph{randomly} chosen configurations $t$ and $s$ of a cellular automata of length $n$, find the number of transitions $τ$ between $s$ and $t$. [SDDP$^δ_{k,n}$] Given two \emph{randomly} chosen configurations $s$ of a cellular automata of length
openaire +2 more sources
Physicochemical equivalence studies of two amlodipine tablet formulations [PDF]
Scripta Medica, 2018 Introduction: Based on the international drug regulatory requirements, all generic pharmaceutical manufacturers are obliged to ensure that their generic products are similar or equivalent to the innovative brand.
Kecman Sanja +2 more
doaj
High-Speed Tableting of High Drug-Loaded Tablets Prepared from Fluid-Bed Granulated Isoniazid
Pharmaceutics, 2023 The aim of this feasibility study was to investigate the possibility of producing industrial-scale relevant, robust, high drug-loaded (90.9%, w/w) 100 mg dose immediate-release tablets of isoniazid and simultaneously meet the biowaiver requirements. With
Valentyn Mohylyuk, Dace Bandere
doaj +1 more source
Learning (Very) Simple Generative Models is Hard
Advances in Neural Information Processing Systems 35, 2022 Motivated by the recent empirical successes of deep generative models, we study the computational complexity of the following unsupervised learning problem. For an unknown neural network $F:\mathbb{R}^d\to\mathbb{R}^{d'}$, let $D$ be the distribution over $\mathbb{R}^{d'}$ given by pushing the standard Gaussian $\mathcal{N}(0,\textrm{Id}_d)$ through $F$
Sitan Chen, Jerry Li 0001, Yuanzhi Li
openaire +3 more sources
Hardness of LWE on General Entropic Distributions
, 2020 The hardness of the Learning with Errors (LWE) problem is by now a cornerstone of the cryptographic landscape. In many of its applications the so called ``LWE secret'' is not sampled uniformly, but comes from a distribution with some min-entropy. This variant, known as ``Entropic LWE'', has been studied in a number of works, starting with Goldwasser et
Brakerski, Zvika, Döttling, Nico
openaire +2 more sources