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)

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- Liâ€™ang Zhang, Suyun Geng
- Journal of Computer Science and Technology
- 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

- Robert A. Hearn
- 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)

Is this relevant?

2005

2005

- Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro
- IJCAI
- 2005

Amazons is a perfect information board game with simple rules and large branching factors. Two players alternately move chessâ€¦Â (More)

Is this relevant?

2005

2005

- Robert A. Hearn
- ArXiv
- 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)

Is this relevant?

2000

2000

- Michael Buro
- Computers and Games
- 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)

Is this relevant?

2000

2000

Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights

- Peter Jonsson
- Theor. Comput. Sci.
- 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

- INSTELLING ANTWERPEN, Alain Verschoren
- 1998

A genetic algorithm (GA) is an iterative and stochastic search procedure which is most often used to obtain acceptableâ€¦Â (More)

Is this relevant?

1997

1997

- Bart Naudts, Dominique Suys, Alain Verschoren
- ICGA
- 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

- Andreas Schirmer
- 1996

NP-completeness and other complexity proofs often merely state that the problem at hand is a generalization of some otherâ€¦Â (More)

Is this relevant?

1985

1985

- Ming-Deh A. Huang, Karl J. Lieberherr
- Theor. Comput. Sci.
- 1985

We develop and analyze P-optimal approximation algorithms for various generalized satisfiability problems and determine theâ€¦Â (More)

Is this relevant?