Results 171 to 180 of about 460,881 (203)

Aggregability is NP-hard

ACM SIGACT News, 2006
Many dynamical systems are aggregable in the sense that we can divide their variables x 1 ,..., x n into several ( k ) non-intersecting groups and find combinations y 1
Kreinovich, Vladik, Shpak, Max
openaire   +2 more sources

Hanano Puzzle is NP-hard

Information Processing Letters, 2019
Abstract We show that the Hanano Puzzle, a side-viewed 2-dimensional combinatorial puzzle with gravity and colored blocks, is NP -hard.
Ziwen Liu, Chao Yang 0003
openaire   +2 more sources

The approximability of NP-hard problems

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
Many problems in combinatorial optimization are NP-hard (see [60]). This has forced researchers to explore techniques for dealing with NP-completeness. Some have considered algorithms that solve “typical” or “average” instances instead of worst-case instances [86, 100]. In practice, however, identifying “typical” instances is not easy.
openaire   +1 more source

Embeddability in R ³ is NP-hard

Journal of the ACM, 2020
We prove that the problem of deciding whether a two- or three-dimensional simplicial complex embeds into R 3 is NP -hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an S 3 filling is NP -hard.
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer   +3 more
openaire   +4 more sources

On the NP-Hardness of Max-Not-2

SIAM Journal on Computing, 2012
We prove that, for any $\epsilon>0$, given a satisfiable instance of Max-NTW (Not-2), it is NP-hard to find an assignment that satisfies a fraction $\frac 58 +\epsilon$ of the constraints. This, up to the existence of $\epsilon$, matches the approximation ratio obtained by the trivial algorithm that just picks an assignment at random, and thus the ...
openaire   +3 more sources

The String Barcoding Problem is NP-Hard

2005
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all members of a set of given strings. In a computational biology context, the given strings represent a set of known viruses, while the substrings can be used as probes for an ...
Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi   +2 more
openaire   +2 more sources

FINDING TYPE SETS IS NP-HARD

International Journal of Algebra and Computation, 1991
It is shown that determining the type set of the variety generated by a finite algebra is a P-Space-hard problem. This is done by interpreting into it the P-Space-complete problem of determining if a given function is a composition of a set of unary functions on a set.
openaire   +2 more sources

An NP-Hardness Result for Nonlinear Systems

Reliable Computing, 1998
The paper presents a system of nonlinear equations, the solution of which is NP-hard. Since it contains only linear and bilinear terms, it is simple looking and has many attractive features. On the other hand, a correspondence with a knapsack problem yields NP-hardness. Besides this, the paper contains several comments on interval analysis.
openaire   +3 more sources

Witness Encryption and NP-Hardness of Learning.

Electron. Colloquium Comput. Complex.
We study connections between two fundamental questions from computer science theory. (1) Is witness encryption possible for NP [Sanjam Garg et al., 2013]? That is, given an instance x of an NP-complete language L, can one encrypt a secret message with security contingent on the ability to provide a witness for x ∈ L?
Goldberg, Halley, Kabanets, Valentine
openaire   +3 more sources

Scratch hardness at a small scale: Experimental methods and correlation to nanoindentation hardness

Tribology International, 2021
Steffen Brinckmann, Gerhard Dehm
exaly