Search results

[[Category:Weakly NP-complete problems]] ...

...ess''' is a property of computational problems that is a special case of [[NP-complete]]ness. A general computational problem may have numerical parameters. For ...ss=free}}</ref> A problem is said to be strongly [[NP-hard]] if a strongly NP-complete problem has a pseudo-polynomial reduction to it. This pseudo-polynomial red ...

...]] problem with known pseudo-polynomial time algorithms is called [[weakly NP-complete]]. An [[NP-complete]] problem is called [[strongly NP-complete]] if it is proven that it cannot be solved by a pseudo-polynomial time alg ...

{{Short description|List of unsolved computational problems}} This article is a [[Lists of unsolved problems|list of notable unsolved problems]] in [[computer science]]. A problem in computer science is considered unso ...

{{Short description|Strongly NP-complete problem in computer science}} The '''3-partition problem''' is a [[Strong NP-completeness|strongly NP-complete]] problem in [[computer science]]. The problem is to decide whether a give ...

...ling]], which is itself a special case of [[optimal job scheduling]]. Many problems, which are NP-hard in general, can be solved in polynomial time in the sing ...d [[Optimal job scheduling|three-field notation for optimal job scheduling problems]], the single-machine variant is denoted by '''1''' in the first field. For ...

{{Short description|NP-complete problem in computer science}} ...m of the numbers in ''S''₂. Although the partition problem is [[NP-complete]], there is a [[pseudo-polynomial time]] [[dynamic programming]] solution, ...

...d [[Optimal job scheduling|three-field notation for optimal job scheduling problems]], the uniform-machine variant is denoted by '''Q''' in the first field. Fo ...ated machines. These algorithms run in exponential time (recall that these problems are all NP-hard). ...

...P-completeness|NP-complete]]. Moreover, some restricted variants of it are NP-complete too, for example:<ref name="kleinberg2006p491" /> ...Cite web |last=Goodrich |first=Michael |title=More NP complete and NP hard problems |url=https://www.ics.uci.edu/~goodrich/teach/cs162/notes/pnp3.pdf |archive- ...

...lynomially bounded, it can still be automatable. A proof system ''P'' is ''weakly automatable'' if there is a proof system ''R'' and an algorithm that given * Krajíček and Pudlák (1998) proved that Extended Frege is not weakly automatable unless [[RSA encryption|RSA]] is not secure against [[P/poly]]. ...

...erated (i.e. the two definitions are [[weak equivalence (formal languages)|weakly equivalent]]), but it does make a difference in terms of what grammars are === (Weakly) equivalent definitions === ...

...ption 1 is false, since the unique solution of the linear equations is not weakly positive. But in this case, option 2 is true: ...ntersection <math>NP \cap coNP</math> are also called ''well-characterized problems''. It is a long-standing open question whether <math>NP \cap coNP</math> is ...

...domains, where this problem is applied, are in [[image editing]], lighting problems of a stage or installation of infrastructures for the warning of natural di ...edge guards. For vertex guarding the subclass of simple polygons that are weakly visible from an edge, a [[polynomial-time approximation scheme]] was propos ...

...location=Reading, Mass. | isbn=0-201-53082-1 }}</ref> [[Decision problem|Problems]] for which a deterministic polynomial-time algorithm exists belong to the ...between '''[[Strongly-polynomial time|strongly polynomial time]]''' and '''weakly polynomial time''' algorithms. ...

...raphs]]. They have been studied extensively and there are a number of open problems relating to their existence and commonness. ...

...ping the overall weight under or equal to 15&nbsp;kg? A [[List of knapsack problems#Multiple constraints|multiple constrained problem]] could consider both the .../7657822859549cd6b12b0d1f76f8ee3680a0.pdf Reducibility Among Combinatorial Problems]". In R. E. Miller and J. W. Thatcher (editors). Complexity of Computer Com ...

...ss of solving certain [[mathematical optimization]] [[optimization problem|problems]] involving [[quadratic function]]s. Specifically, one seeks to optimize (m ...ing" in this context refers to a formal procedure for solving mathematical problems. This usage dates to the 1940s and is not specifically tied to the more rec ...

...[[perfect graph]]s. They may be recognized in [[linear time]], and several problems that are hard on other classes of graphs such as [[graph coloring]] may be ...phs in linear time. The [[graph sandwich problem]] on chordal graphs is [[NP-complete]]{{sfnp|Bodlaender|Fellows|Warnow|1992}} whereas the probe graph problem on ...

...rc set can be approximated more accurately, and for [[planar graph]]s both problems can be solved exactly in polynomial time. Several problems involving rankings or orderings can be solved by finding a feedback arc set ...

...p | year = 1975 | title = On the computational complexity of combinatorial problems | journal = Networks | volume = 5 | pages = 45–68 | doi=10.1002/net.1975.5. ...rmational complexity and effective methods of solution for convex extremal problems | journal = Ekonomika I Matematicheskie Metody | volume = 12 | pages = 357– ...