Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Subhash Khot

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 Dana Moshkovitz

> Home > Persons > Subhash Khot

Publications

2018
[i37]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/KhotMMS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/KhotMMS18
Subhash Khot, Dor Minzer, Dana Moshkovitz, Muli Safra:
Small Set Expansion in The Johnson Graph. Electron. Colloquium Comput. Complex. TR18 (2018)
2016
[c65]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/KhotM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/KhotM16
Subhash Khot, Dana Moshkovitz:
Candidate hard unique game. STOC 2016: 63-76
2014
[i25]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/KhotM14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/KhotM14
Subhash Khot, Dana Moshkovitz:
Candidate Lasserre Integrality Gap For Unique Games. Electron. Colloquium Comput. Complex. TR14 (2014)
2013
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/KhotM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/KhotM13
Subhash Khot, Dana Moshkovitz:
NP-Hardness of Approximately Solving Linear Equations over Reals. SIAM J. Comput. 42(3): 752-791 (2013)
2011
[c51]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/KhotM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/KhotM11
Subhash Khot, Dana Moshkovitz:
NP-hardness of approximately solving linear equations over reals. STOC 2011: 413-420
2010
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1002-3864
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1002-3864
Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer:
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010)
[i10]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/KhotM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/KhotM10
Subhash Khot, Dana Moshkovitz:
NP-Hardness of Approximately Solving Linear Equations Over Reals. Electron. Colloquium Comput. Complex. TR10 (2010)
[i9]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/MoshkovitzK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/MoshkovitzK10
Dana Moshkovitz, Subhash Khot:
Hardness of Approximately Solving Linear Equations Over Reals. Electron. Colloquium Comput. Complex. TR10 (2010)

a service of

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.