"Complexity Upper Bounds for Classical Locally Random Reductions Using a ..."

Rahul Tripathi (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-74456-6_49

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/Tripathi07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/Tripathi07
Rahul Tripathi:
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument. MFCS 2007: 548-558

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.