Computational Complexity of Some Problems on Generalized Cellular Automations by P. G. Klyucharev

Subjects: Get full text

Two railway circuits: a universal circuit and an NP-difficult one by Maurice Margenstern

Subjects: Get full text

NP-completeness of weakly convex and convex dominating set decision problems by Joanna Raczek

Subjects: Get full text

The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search by Bo Moon

Subjects: “…NP Completeness, Quantum Search, Subset Sum Problem…”
Get full text

Hard to Detect Factors of Univariate Integer Polynomials by Alberto Dennunzio, Enrico Formenti, Luciano Margara

Subjects: Get full text

Partitioning to three matchings of given size is NP-complete for bipartite graphs by Pálvölgyi Dömötör

Subjects: “…np-completeness…”
Get full text

Complexity of domination in triangulated plane graphs by Pálvölgyi Dömötör

Subjects: “…np-completeness…”
Get full text

Probabilistic Nearest Neighbors Classification by Bruno Fava, Paulo C. Marques F., Hedibert F. Lopes

Subjects: Get full text

The Problem of Finding the Maximal Multiple Flow in the Divisible Network and its Special Cases by A. V. Smirnov

Subjects: Get full text

Hardness and Approximability of Dimension Reduction on the Probability Simplex by Roberto Bruno

Subjects: Get full text

Even Simple Processes of π-calculus are Hard for Analysis by Marat M. Abbas, Vladimir A. Zakharov

Subjects: Get full text

Some complexity results on semipaired domination in graphs by Vikash Tripathi, Kusum, Arti Pandey

Subjects: Get full text

An Algebraic Approach to the Solutions of the Open Shop Scheduling Problem by Agustín Moreno Cañadas, Odette M. Mendez, Juan-Carlos Riaño-Rojas, Juan-David Hormaza

Subjects: Get full text

NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem by Natalya Sergeevna Medvedeva, Alexander Valeryevich Smirnov

Subjects: Get full text

Algorithmic study of d2-transitivity of graphs by Subhabrata Paul, Kamal Santra

Subjects: Get full text

Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective by Chuan-Min Lee

Subjects: Get full text

A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4 by Giaro Krzysztof, Kubale Marek

Subjects: Get full text

Progress on Roman and Weakly Connected Roman Graphs by Joanna Raczek, Rita Zuazua

Subjects: Get full text

Settling Multiple Debts Efficiently: An Invitation to Computing Science by Tom VERHOEFF

Subjects: Get full text

On the Complexity of the 3-Kernel Problem in Some Classes of Digraphs by Hell Pavol, Hernández-Cruz César

Subjects: Get full text