The top documents tagged [polynomial p]

1 L is in NP means: There is a language L’ in P and a polynomial p so that L 1 · L 2 means: For some polynomial time computable map r : 8 x: x 2 L 1 iff
Documents 1 L is in NP means: There is a language L’ in P and a polynomial p so that L 1 · L 2 means: For some polynomial time computable map r : 8 x: x 2 L 1 iff

213 views

CP - 2001 1 Formal Models of Heavy-Tailed Behavior in Combinatorial Search Hubie Chen, Carla P. Gomes, and Bart Selman {hubes,gomes,selman}@cs.cornell.edu
Documents CP - 2001 1 Formal Models of Heavy-Tailed Behavior in Combinatorial Search Hubie Chen, Carla P. Gomes, and Bart Selman {hubes,gomes,selman}@cs.cornell.edu

215 views

1 Slides by Iddo Tzameret and Gil Shklarski. Adapted from Oded Goldreich’s course lecture notes by Erez Waisbard and Gera Weiss
Documents 1 Slides by Iddo Tzameret and Gil Shklarski. Adapted from Oded Goldreich’s course lecture notes by Erez Waisbard and Gera Weiss

213 views

Zero-Knowledge Proof System Slides by Ouzy Hadad, Yair Gazelle & Gil Ben-Artzi Adapted from Ely Porat course lecture notes
Documents Zero-Knowledge Proof System Slides by Ouzy Hadad, Yair Gazelle & Gil Ben-Artzi Adapted from Ely Porat course lecture notes

215 views

Randomized Computation Slides submitted by Igor Nor, Alex Pomeransky and Shimon Pomeransky Adapted from Ely Porat’s course lecture
Documents Randomized Computation Slides submitted by Igor Nor, Alex Pomeransky and Shimon Pomeransky Adapted from Ely Porat’s course lecture

217 views

1 91.304 Foundations of (Theoretical) Computer Science Chapter 3 Lecture Notes (Section 3.3: Definition of Algorithm) David Martin dm@cs.uml.edu With significant
Documents 1 91.304 Foundations of (Theoretical) Computer Science Chapter 3 Lecture Notes (Section 3.3: Definition of Algorithm) David Martin [email protected] With significant

214 views

Computer Science Fundamentals A topics course in Computer Science
Documents Computer Science Fundamentals A topics course in Computer Science

254 views

Zero Knowledge Proofs. Interactive proof An Interactive Proof System for a language L is a two-party game between a verifier and a prover that interact
Documents Zero Knowledge Proofs. Interactive proof An Interactive Proof System for a language L is a two-party game between a verifier and a prover that interact

223 views

ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 23 CURVE FITTING Chapter 18 Function Interpolation and Approximation
Documents ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 23 CURVE FITTING Chapter 18 Function Interpolation and Approximation

236 views

New developments in Circuit Complexity From Circuit-SAT Algorithms to Circuit Lower Bounds
Documents New developments in Circuit Complexity From Circuit-SAT Algorithms to Circuit Lower Bounds

26 views

Slides by Iddo Tzameret and Gil Shklarski
Documents Slides by Iddo Tzameret and Gil Shklarski

39 views

Efficient Non-Malleable Codes and Key-derivations against Poly-size Tampering Circuits
Documents Efficient Non-Malleable Codes and Key-derivations against Poly-size Tampering Circuits

24 views