Skip to contents

Goldreich, Oded [Author]

Modern cryptography, probabilistic proofs and pseudorandomness

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin; Heidelberg [u.a.]: Springer, 1999

Published in: Algorithms and combinatorics ; 17
Mayr, Ernst W. [Editor]

Lectures on proof verification and approximation algorithms

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin; Heidelberg [u.a.]: Springer, 1998

Published in: Lecture notes in computer science ; 1367
Chiesa, Alessandro [Author]; Liu, Siqi [Author] ; Alessandro Chiesa and Siqi Liu [Contributor]

On the Impossibility of Probabilistic Proofs in Relativized Worlds

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
Chiesa, Alessandro [Author]; Guan, Ziyi [Author]; Yıldız, Burcu [Author] ; Alessandro Chiesa and Ziyi Guan and Burcu Yıldız [Contributor]

On Parallel Repetition of PCPs

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
Dinur, Irit [Author]; Goldreich, Oded [Author]; Gur, Tom [Author] ; Irit Dinur and Oded Goldreich and Tom Gur [Contributor]

Every Set in P Is Strongly Testable Under a Suitable Encoding

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Arvind, Vikraman [Author]; Köbler, Johannes [Author]; Schuler, Rainer [Author]

On helping and interactive proof systems

View online
Schließen

Access

More information on the full text

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Ulm: Universität Ulm, Fakultät für Ingenieurwissenschaften und Informatik, 2010

Published in: Ulmer Informatik-Berichte ; 94,05
Ben-Sasson, Eli [Author]; Chiesa, Alessandro [Author]; Gabizon, Ariel [Author]; Riabzev, Michael [Author]; Spooner, Nicholas [Author] ; Eli Ben-Sasson and Alessandro Chiesa and Ariel Gabizon and Michael Riabzev and Nicholas Spooner [Contributor]

Interactive Oracle Proofs with Constant Rate and Query Complexity

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
Harsha, Prahladh [Author]; Khot, Subhash [Author]; Lee, Euiwoong [Author]; Thiruvenkatachari, Devanathan [Author] ; Prahladh Harsha and Subhash Khot and Euiwoong Lee and Devanathan Thiruvenkatachari [Contributor]

Improved 3LIN Hardness via Linear Label Cover

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Chiesa, Alessandro [Author]; Manohar, Peter [Author]; Shinkar, Igor [Author] ; Alessandro Chiesa and Peter Manohar and Igor Shinkar [Contributor]

Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Bhangale, Amey [Author]; Dinur, Irit [Author]; Livni Navon, Inbal [Author] ; Amey Bhangale and Irit Dinur and Inbal Livni Navon [Contributor]

Cube vs. Cube Low Degree Test

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
Dell, Holger [Author]; van Melkebeek, Dieter [Author] ; Holger Dell and Dieter van Melkebeek [Contributor]

Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2010
Mayr, Ernst W. [Author] ; Prömel, Hans Jürgen [Other]; Steger, Angelika [Other]

Lectures on Proof Verification and Approximation Algorithms

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin, Heidelberg: Springer Berlin Heidelberg, 1998

Published in: Lecture notes in computer science ; 1367
Goldreich, Oded [Editor]

Computational Complexity and Property Testing : On the Interplay Between Randomness and Computation - [1st ed. 2020.]

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Cham: Springer International Publishing, 2020. ; Cham: Imprint: Springer, 2020.

Published in: Theoretical Computer Science and General Issues ; 12050- Springer eBook Collection
Paradise, Orr [Author] ; Orr Paradise [Contributor]

Smooth and Strong PCPs

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
Raskhodnikova, Sofya [Author]; Ron-Zewi, Noga [Author]; Varma, Nithin [Author] ; Sofya Raskhodnikova and Noga Ron-Zewi and Nithin Varma [Contributor]

Erasures vs. Errors in Local Decoding and Property Testing

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Gur, Tom [Author]; Ramnarayan, Govind [Author]; Rothblum, Ron D. [Author] ; Tom Gur and Govind Ramnarayan and Ron D. Rothblum [Contributor]

Relaxed Locally Correctable Codes

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
Khot, Subhash [Author] ; Subhash Khot [Contributor]

Hardness of Approximation (Invited Talk)

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
Khot, Subhash [Author] ; Subhash Khot [Contributor]

On Approximation Resistance of Predicates (Invited Talk)

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2013
Dyer, Martin [Author]; Feige, Uriel [Author]; Frieze, Alan M. [Author]; Karpinski, Marek [Author] ; Martin Dyer and Uriel Feige and Alan M. Frieze and Marek Karpinski [Contributor]

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2011
Dell, Holger [Author] ; Grohe, Martin [Contributor]; Köbler, Johannes [Contributor]; Melkebeek, Dieter van [Contributor]

Sparse instances of hard problems

View online
Schließen

Links

http://edoc.hu-berlin.de/18452/17027

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2011-09-01

You did not find what you were looking for?

Purchase suggestion
Are you missing something you need for your research? If you have any suggestions please share them here.

Interlibrary Loan
Please search and order your favorite title in the Interlibrary Loan Portal.

Search in field:

Recently searched for:

You did not find what you were looking for?

> Year of publication

Year of publication