Results 41 to 50 of about 272,983 (311)
Even Simple Processes of π-calculus are Hard for Analysis
Моделирование и анализ информационных систем, 2018 Mathematical models of distributed computations, based on the calculus of mobile processes (π-calculus) are widely used for checking the information security properties of cryptographic protocols.
Marat M. Abbas, Vladimir A. Zakharov
doaj +1 more source
Instruction Sequence Based Non-uniform Complexity Classes [PDF]
Scientific Annals of Computer Science, 2014 We present an approach to non-uniform complexity in which single-pass instruction sequences play a key part, and answer various questions that arise from this approach. We introduce several kinds of non-uniform complexity classes.
J.A. Bergstra, C.A. Middelburg
doaj +1 more source
Vertex order with optimal number of adjacent predecessors [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 In this paper, we study the complexity of the selection of a graph discretization order with a stepwise linear cost function. Finding such vertex ordering has been proved to be an essential step to solve discretizable distance geometry problems (DDGPs ...
Jérémy Omer, Tangi Migot
doaj +1 more source
Information Processing Letters, 2006 Tetravex is a widely played one person computer game in which you are given $n^2$ unit tiles, each edge of which is labelled with a number. The objective is to place each tile within a $n$ by $n$ square such that all neighbouring edges are labelled with an identical number. Unfortunately, playing Tetravex is computationally hard.
Yasuhiko Takenaga, Toby Walsh
openaire +3 more sources
Mathematics, 2022 In this work, we investigate the variant of the Internet Shopping Optimization Problem (ISHOP) that considers different item units. This variant is more challenging than the original problem. The original ISHOP is already known as a combinatorial NP-hard
Fernando Ornelas +9 more
doaj +1 more source
Separating NP-Completeness Notions under Strong Hypotheses
, 2000 Lutz (1993, “Proceedings of the Eight Annual Conference on Structure in Complexity Theory,” pp. 158–175) proposed the study of the structure of the class NP=NTIME(poly) under the hypothesis that NP does not have p-measure 0 (with respect to Lutz's ...
Bentzien, Levke, Ambos-Spies, Klaus
core +1 more source
Molecular Oncology, EarlyView.Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat +8 more
wiley +1 more source
Molecular Oncology, EarlyView.Dimethyl fumarate (DMF) reduces growth of HPV‐positive cervical cancer spheroids and induces ferroptosis in cervical cancer cells via blocking SLC7A11/Glutathione (GSH) axis. Combination of subcytotoxic doses of DMF and cisplatin (CDDP) further suppresses spheroid growth and drives cell death in 2D culture models.
Carolina Punziano +6 more
wiley +1 more source
NP-completeness of the Eulerian walk problem for a multiple graph
Моделирование и анализ информационных системIn this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)
Alexander V. Smirnov
doaj +1 more source
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)In this work, we prove the NP-completeness of two variants of tokenisation, defined here as the problem of compressing a dataset to at most 𝛿 symbols by either finding a vocabulary directly (_direct_ tokenisation), or selecting a sequence of merge operations (_bottom-up_ tokenisation).
Philip Whittington +2 more
openaire +3 more sources