Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Weak NP-completeness

Known as: Weakly NP-complete 
In computational complexity, an NP-complete (or NP-hard) problem is weakly NP-complete (or weakly NP-hard), if there is an algorithm for the problem… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2020
2020
The robust minimum cost flow problem under consistent flow constraints (RobMCF≡) is a new extension of the minimum cost flow (MCF… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
We study a flow problem where a source streams information to a sink over a directed graph G=(V;E) possibly using multiple paths… Expand
  • table I
  • figure 1
  • figure 2
  • table II
  • figure 3
Is this relevant?
2017
2017
We study a delay-sensitive information flow problem where a source streams information to a sink over a directed graph G = (V, E… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2016
2016
The objective of partial satisfaction planning is to achieve an as valuable as possible state, tacking into account the cost of… Expand
  • figure 1
Is this relevant?
2015
2015
The problem of efficiently computing and visualizing the structural resemblance between a pair of protein backbones in 3D has led… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2011
2011
The knapsack problem is one of the basic problems in combinatorial optimization. In real-world applications it is often part of a… Expand
  • table 3
  • figure 1
  • table 4
  • figure 2
Is this relevant?
2008
2008
We study the integer maximum flow problem on wireless sensor networks with energy constraint. In this problem, sensor nodes… Expand
  • figure 1
  • figure 2
Is this relevant?
2005
2005
A “project manager” wishes to complete a project (e.g., a weapons-development program) as quickly as possible. Using a limited… Expand
Is this relevant?
2004
2004
When donating money to a (say, charitable) cause, it is possible touse the contemplated donation as negotiating material to… Expand
Is this relevant?