Results 41 to 50 of about 3,990 (244)
Restricted optimal pebbling is NP-hard
Discrete Applied Mathematics, 2023 Consider a distribution of pebbles on a graph. A pebbling move removes two pebbles from a vertex and place one at an adjacent vertex. A vertex is reachable under a pebble distribution if it has a pebble after the application of a sequence of pebbling moves. A pebble distribution is solvable if each vertex is reachable under it.
openaire +2 more sources
On the Complexity of Optimal k-Anonymity: A New Proof Based on Graph Coloring
IEEE AccessPrivacy is a complex balancing problem between risks and utility of data. K-anonymity, a fundamental model for preserving privacy, guarantees that an item cannot be differentiated from at least k-1 other items.
Yavuz Canbay
doaj +1 more source
Identification and signatures based on NP-hard problems of indefinite quadratic forms
Journal of Mathematical Cryptology, 2008 We prove NP-hardness of equivalence and representation problems of quadratic forms under probabilistic reductions, in particular for indefinite, ternary quadratic forms with integer coefficients.
Hartung Rupert J., Schnorr Claus-Peter
doaj +1 more source
Unshuffling a square is NP-hard
Journal of Computer and System Sciences, 2014 A shuffle of two strings is formed by interleaving the characters into a new string, keeping the characters of each string in order. A string is a square if it is a shuffle of two identical strings. There is a known polynomial time dynamic programming algorithm to determine if a given string z is the shuffle of two given strings x,y; however, it has ...
Buss, Sam, Soltys, Michael
openaire +2 more sources
Pharmaceutics, 2022 We previously reported that the bioavailability (BA) of irbesartan (IRB), a BSC class II drug, was improved by preparing nanocrystalline suspensions. However, nanocrystalline suspensions have chemical and physical instabilities and must be converted into
Noriaki Nagai +7 more
doaj +1 more source
Journal of Symbolic Computation, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Apt, K.R. +2 more
openaire +2 more sources
Advanced Functional Materials, EarlyView.In this study, the interplay of dipolar dynamics and ionic charge transport in MOF compounds is investigated. Synthesizing the novel structure CFA‐25 with integrated freely rotating dipolar groups, local and macroscopic effects, including interactions with Cs cations are explored.
Ralph Freund +6 more
wiley +1 more source
Advanced Functional Materials, EarlyView.An oral nanoplatform, MOP@T@D, which can maintain glucose homeostasis and restore islet β cells in diabetic rats is developed. It achieves efficient intestinal absorption and liver‐targeted delivery. The nanoparticle disintegrates only in response to hyperglycemia to release insulin on demand and provides antioxidant protection through selenoprotein ...
Chenxiao Chu +14 more
wiley +1 more source
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Algorithms, 2020 Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.
Andreas Emil Feldmann +3 more
doaj +1 more source
On Comparing the Similarity and Dissimilarity Between Two Distinct Vehicular Trajectories
IEEE Access, 2021 In this paper, we study the problem of comparing the similarity and dissimilarity between two distinct vehicular trajectories by proposing an adjacency-based metric.
Letu Qingge +4 more
doaj +1 more source