Results 131 to 140 of about 35,538 (168)
, 2004 Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +1 more source
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 +1 more source
1994
This chapter establishes the NP-hardiness of a number of scheduling problems. To prove that a given Problem B is NP-hard, we use the following scheme. The decision Problem B’ corresponding to Problem B is formulated, and a Problem A is shown to be polynomially reducible to B’ where A is one of the standard problems, i.e., a decision problem known to be
V. S. Tanaev +2 more
openaire +1 more source
This chapter establishes the NP-hardiness of a number of scheduling problems. To prove that a given Problem B is NP-hard, we use the following scheme. The decision Problem B’ corresponding to Problem B is formulated, and a Problem A is shown to be polynomially reducible to B’ where A is one of the standard problems, i.e., a decision problem known to be
V. S. Tanaev +2 more
openaire +1 more source
$(2+\varepsilon)$-Sat Is NP-hard
SIAM Journal on Computing, 2017Summary: We prove the following hardness result for a natural promise variant of the classical CNF-satisfiability problem: Given a CNF-formula where each clause has width \(w\) and the guarantee that there exists an assignment satisfying at least \(g=\lceil\frac{w}{2}\rceil-1\) literals in each clause, it is NP-hard to find a satisfying assignment to ...
Austrin, Per +2 more
openaire +1 more source
Approximation Algorithms for NP-Hard Problems
Oberwolfach Reports, 2005It is an interesting artifact that most computational tasks today that arise in realistic scenarios are intractable, at least if one insists on delivering exact solutions with certainty within a strict deadline. An important mean for surmounting this intractability barrier is that of approximate computation
Ravindran Kannan, Marek Karpinski
openaire +2 more sources
2020
A cynical view of graph algorithms is that “everything we want to do is hard.” Indeed, all problems in this section are provably NP-complete with the exception of graph isomorphism—whose complexity status remains an open question. The theory of NP-completeness demonstrates that either all NP-complete problems have polynomial-time algorithms, or none of
openaire +1 more source
A cynical view of graph algorithms is that “everything we want to do is hard.” Indeed, all problems in this section are provably NP-complete with the exception of graph isomorphism—whose complexity status remains an open question. The theory of NP-completeness demonstrates that either all NP-complete problems have polynomial-time algorithms, or none of
openaire +1 more source
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
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