Georgetown

Results: 5151



#Item
11Computational complexity theory / Complexity classes / Boolean algebra / IP / True quantified Boolean formula / Interactive proof system / PSPACE / NP / Boolean satisfiability problem / FO / Linear temporal logic / ArthurMerlin protocol

COSC 544 Probabilistic Proof SystemsLFKN’s Interactive Proof for #SAT Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-09-18 12:17:56
12Circuit complexity / Complexity classes / Theory of computation / Theoretical computer science / Computer science / NC / Circuit / Computer / IP / NP / Multiplication algorithm / Matrix multiplication algorithm

COSC 544 Probabilistic Proof SystemsTurning Computer Programs Into Circuits (Part 1) Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-10-10 11:45:28
13Computational complexity theory / Mathematics / Complexity classes / IP / Circuit complexity / True quantified Boolean formula / NP / SchwartzZippel lemma / NC

COSC 544 Probabilistic Proof SystemsThe GKR Protocol and Its Efficient Implementation Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-10-06 11:09:52
14Mathematics / Complexity classes / Randomized algorithms / IP / Probabilistically checkable proof / NP / NEXPTIME / Soundness / Variable / Interactive proof system / Proof of knowledge

COSC 544 Probabilistic Proof SystemsA State of the Art MIP For Circuit Satisfiability Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-10-16 18:20:55
15Algebra / Abstract algebra / Mathematics / Probabilistically checkable proof / Valuation / Tensor product

COSC 544 Probabilistic Proof SystemsA First Linear PCP (Of Size |F|O(S ) )

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-11-02 08:26:19
16Mathematics / Algebra / Polynomials / Probabilistically checkable proof / Computer algebra / IP / Complex number / MAX-3SAT

COSC 544 Probabilistic Proof SystemsA PCP of Quasilinear Size for Arithmetic Circuit-SAT Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-11-22 13:48:36
17Computational complexity theory / Randomized algorithms / Analysis of algorithms / With high probability / PP / IP / RP / P / Freivalds' algorithm

COSC 544 Probabilistic Proof SystemsThe Power of Randomness: Fingerprinting and Freivalds’ Algorithm Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-09-14 15:31:47
18

PDF Document

Add to Reading List

Source URL: people.cs.georgetown.edu

- Date: 2010-04-21 19:47:30
    19

    PDF Document

    Add to Reading List

    Source URL: security.cs.georgetown.edu

    - Date: 2017-03-21 10:20:48
      20

      PDF Document

      Add to Reading List

      Source URL: security.cs.georgetown.edu

      - Date: 2017-11-27 15:08:03
        UPDATE