NP-equivalent

In computational complexity theory, the complexity class NP-equivalent is the set of function problems that are both NP-easy and NP-hard. NP… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2012
01219852012

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
In this paper complexity of the 0/1 multi-knapsack problem is discussed. First we prove that the corresponding decision problem… (More)
Is this relevant?
2007
2007
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Amazons is a perfect information board game with simple rules and large branching factors. Two players alternately move chess… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
Amazons is a young board game with simple rules and a high branching factor, which makes it a suitable test-bed for planning… (More)
  • figure 2
  • figure 3
  • figure 10
Is this relevant?
2000
2000
A boolean constraint satisfaction problem consists of some nite set of constraints (i.e., functions from 0/1-vectors to f0; 1g… (More)
Is this relevant?
1998
1998
A genetic algorithm (GA) is an iterative and stochastic search procedure which is most often used to obtain acceptable… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 3.1
Is this relevant?
1997
1997
In this note we measure the interdependency of bits in the encoding of a fitness function using two different invariants. The… (More)
Is this relevant?
1996
1996
NP-completeness and other complexity proofs often merely state that the problem at hand is a generalization of some other… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1985
1985
We develop and analyze P-optimal approximation algorithms for various generalized satisfiability problems and determine the… (More)
Is this relevant?