"All the Needles in a Haystack: Can Exhaustive Search Overcome ..."

Jürg Nievergelt et al. (1995)

> Home

Details and statistics

DOI: 10.1007/BFB0015248

access: closed

type: Part in Book or Collection

metadata version: 2017-05-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/sp/cstoday95/NievergeltGMW95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/cstoday95/NievergeltGMW95
Jürg Nievergelt, Ralph Gasser, Fabian Mäser, Christoph Wirth:
All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos? Computer Science Today 1995: 254-274

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.