Results 31 to 40 of about 460,881 (203)
On Percolation and $NP$-Hardness
CoRR, 2015 We consider the robustness of computational hardness of problems whose input is obtained by applying independent random deletions to worst-case instances. For some classical $NP$-hard problems on graphs, such as Coloring, Vertex-Cover, and Hamiltonicity, we examine the complexity of these problems when edges (or vertices) of an arbitrary graph are ...
Daniel Reichman 0001, Igor Shinkar
openaire +3 more sources
Clustering Affine Subspaces: Algorithms and Hardness [PDF]
, 2012 We study a generalization of the famous k-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinations of parameters.
Lee, Euiwoong
core +1 more source
On the NP-hardness of GRacSim drawing and k-SEFE Problems
Journal of Graph Algorithms and Applications, 2018 We study the complexity of two problems on simultaneous graph drawing. The first problem, $\rm{GR{\small AC} S{\small IM~DRAWING}}$, asks for finding a simultaneous geometric embedding of two planar graphs, sharing a common subgraph, such that only ...
Luca Grilli
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 ...
Sam Buss, Michael Soltys
openaire +3 more sources
Automating cutting planes is NP-hard [PDF]
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020 Full version of the conference version at STOC 2020 by the same ...
Mika Göös +3 more
openaire +3 more sources
Hardness amplification within NP [PDF]
, 2004 In this paper we investigate the following question: if NP is slightly hard on average, is it very hard on average? We give a positive answer: if there is a function in NP which is infinitely often balanced and (1−1/poly(n))-hard for circuits of ...
O'Donnell, Ryan, Ryan O'Donnell
core +1 more source
J. Comput. Geom., 2018 In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldability with optional creases is strongly NP-hard by a reduction from 1-in-3 SAT.
Hugo A. Akitaya +5 more
openaire +3 more sources
The Journey from NP to TFNP Hardness [PDF]
, 2017 The class TFNP is the search analog of NP with the additional guarantee that any instance has a solution. TFNP has attracted extensive attention due to its natural syntactic subclasses that capture the computational complexity of important search ...
Hubácek, Pavel +2 more
core +1 more source
Protein Design is NP-hard [PDF]
Protein Engineering, Design and Selection, 2002 Biologists working in the area of computational protein design have never doubted the seriousness of the algorithmic challenges that face them in attempting in silico sequence selection. It turns out that in the language of the computer science community, this discrete optimization problem is NP-hard. The purpose of this paper is to explain the context
Pierce, Niles A., Winfree, Erik
openaire +3 more sources
Fast approximation algorithms for some maximin clustering problems [PDF]
Yugoslav Journal of Operations ResearchIn this paper, we consider three cases of an intractable problem of searching for two subsets in a finite set of points of Euclidean space. In all three cases, it is required to maximize the minimum cluster’s cardinality under constraint on each cluster ...
Khandeev V., Neshchadim S.
doaj +1 more source