Amanote Research

Amanote Research

    RegisterSign In

A Combinatorial Consistency Lemma With Application to Proving the PCP Theorem

SIAM Journal on Computing - United States
doi 10.1137/s0097539797315744
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science
Date

January 1, 2000

Authors
Oded GoldreichShmuel Safra
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem

English

Proof Certificates for Algebra and Their Application to Automatic Geometry Theorem Proving

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

From the Farkas Lemma to the Hahn--Banach Theorem

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2014English

Cryptographically Sound Theorem Proving

English

The Complexity of Theorem-Proving Procedures

1971English

SMTtoTPTP – A Converter for Theorem Proving Formats

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

On a Combinatorial Problem Associated With the Odd Order Theorem

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1993English

Automated Theorem Proving by Translation to Description Logic

EasyChair Preprints
2018English

Automated Theorem Proving in a Chat Environment

EasyChair Preprints
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy