Results 41 to 50 of about 460,881 (203)
On the Computational Complexity of Optimization Convex Covering Problems of Graphs [PDF]
Computer Science Journal of Moldova, 2020 In this paper we present further studies of convex covers and convex partitions of graphs. Let $G$ be a finite simple graph. A set of vertices $S$ of $G$ is convex if all vertices lying on a shortest path between any pair of vertices of $S$ are in $S ...
Radu Buzatu
doaj
Restrained Italian reinforcement number in graphs
AKCE International Journal of Graphs and Combinatorics, 2023 A restrained Italian dominating function (RID-function) on a graph [Formula: see text] is a function [Formula: see text] satisfying: (i) [Formula: see text] for every vertex [Formula: see text] with [Formula: see text], where [Formula: see text] is the ...
N. Ebrahimi +3 more
doaj +1 more source
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions [PDF]
Quantum, 2020 A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions.
Nai-Hui Chia, Sean Hallgren, Fang Song
doaj +1 more source
Journal of Symbolic Computation, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K.R. Apt (Krzysztof) +2 more
openaire +5 more sources
Reoptimization of NP-Hard Problems [PDF]
, 2018 A reoptimization problem, given two similar instances of an optimization problem and a good solution to the first instance, asks for a solution to the second. In this paper we propose general approximation algorithms applicable to a wide class of reoptimization problems.
openaire +2 more sources
NP-hard problems are not in BQP
CoRR, 2023 Grover's algorithm can solve NP-complete problems on quantum computers faster than all the known algorithms on classical computers. However, Grover's algorithm still needs exponential time. Due to the BBBV theorem, Grover's algorithm is optimal for searches in the domain of a function, when the function is used as a black box.
openaire +3 more sources
Tetris with Few Piece Types [PDF]
We prove NP-hardness and #P-hardness of Tetris clearing (clearing an initial board using a given sequence of pieces) with the Super Rotation System (SRS), even when the pieces are limited to any two of the seven Tetris piece types.
Li, Jeffery +3 more
core +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
Wasserstein Barycenters Are NP-Hard to Compute
SIAM Journal on Mathematics of Data Science, 2022 Computing Wasserstein barycenters (a.k.a. Optimal Transport barycenters) is a fundamental problem in geometry which has recently attracted considerable attention due to many applications in data science. While there exist polynomial-time algorithms in any fixed dimension, all known running times suffer exponentially in the dimension.
Jason M. Altschuler, Enric Boix-Adserà
openaire +3 more sources
Improved hardness amplification in NP [PDF]
, 2006 We study the problem of hardness amplification in NP. We prove that if there is a balanced function in NP such that any circuit of size s(n)=2Ω(n) fails to compute it on a 1/poly(n) fraction of inputs, then there is a function in NP such that any circuit
Chi-jen Lua +5 more
core +1 more source