"The Average Complexity of Depth-First Search with Backtracking and Cutoff."

Harold S. Stone, Paolo Sipala (1986)

> Home

Details and statistics

DOI: 10.1147/RD.303.0242

access: closed

type: Journal Article

metadata version: 2020-03-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ibmrd/StoneS86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ibmrd/StoneS86
Harold S. Stone, Paolo Sipala:
The Average Complexity of Depth-First Search with Backtracking and Cutoff. IBM J. Res. Dev. 30(3): 242-258 (1986)

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.