"Reducing the Time Complexity of the N-Queens Problem."

Eyas El-Qawasmeh, Khader Al-Noubani (2005)

> Home

Details and statistics

DOI: 10.1142/S0218213005002247

access: closed

type: Journal Article

metadata version: 2020-05-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijait/El-QawasmehA05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijait/El-QawasmehA05
Eyas El-Qawasmeh, Khader Al-Noubani:
Reducing the Time Complexity of the N-Queens Problem. Int. J. Artif. Intell. Tools 14(3): 545- (2005)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.