Nisheeth K. Vishnoi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Preyas Popat

> Home > Persons > Nisheeth K. Vishnoi

Publications

2014
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/KhotPV14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/KhotPV14
Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing. SIAM J. Comput. 43(3): 1184-1205 (2014)
2012
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/KhotPV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/KhotPV12
Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
2^{log1-ε n} hardness for the closest vector problem with preprocessing. STOC 2012: 277-288
2011
[i10]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1109-2176
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1109-2176
Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing. CoRR abs/1109.2176 (2011)
[i8]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/KhotPV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/KhotPV11
Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
2^{log^1-έn} Hardness for Closest Vector Problem with Preprocessing. Electron. Colloquium Comput. Complex. TR11 (2011)

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.