"Upper and lower bounds for the average-case complexity of path-search."

Nicholas Pippenger (1999)

> Home

Details and statistics

DOI: 10.1002/(SICI)1097-0037(199907)33:4<249::AID-NET2>3.0.CO;2-7

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Pippenger99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Pippenger99
Nicholas Pippenger:
Upper and lower bounds for the average-case complexity of path-search. Networks 33(4): 249-259 (1999)

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.