Amanote Research

Amanote Research

    RegisterSign In

Combinatorial PCPs With Efficient Verifiers

doi 10.1109/focs.2009.10
Full Text
Open PDF
Abstract

Available in full text

Date

October 1, 2009

Authors
Or Meir
Publisher

IEEE


Related search

Randomness-Efficient Low Degree Tests and Short PCPs via Epsilon-Biased Sets

2003English

Interactive Proofs With Provable Security Against Honest Verifiers

English

Small PCPs With Low Query Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2000English

Efficient Combinatorial Auction Mechanisms in Electronic Commerce

2016English

Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

SIAM Journal on Computing
MathematicsComputer Science
2006English

Rational Proofs Against Rational Verifiers

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Electronic EngineeringComputer GraphicsSignal ProcessingApplied MathematicsElectricalComputer-Aided Design
2017English

PCPS-assisted Anesthesia in a Patient With Marked Airway Stenosis

THE JOURNAL OF JAPAN SOCIETY FOR CLINICAL ANESTHESIA
2013English

Anesthetic Management of a Patient With Tracheal Stenosis Under PCPS.

THE JOURNAL OF JAPAN SOCIETY FOR CLINICAL ANESTHESIA
1998English

Constant Rate PCPs for Circuit-Sat With Sublinear Query Complexity

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy