"Average-case bounds for the complexity of path-search."

Nicholas Pippenger (1997)

> Home

Details and statistics

DOI: 10.1090/DIMACS/042/01

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-09

- view
  - electronic edition via DOI (archived)
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dimacs/Pippenger97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dimacs/Pippenger97
Nicholas Pippenger:
Average-case bounds for the complexity of path-search. Advances in Switching Networks 1997: 1-13

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.