- Home
- » Tags
- » PL (complexity)
Top View
- Analysis of Quantum Multi-Prover Zero-Knowledge Systems: Elimination of the Honest Condition and Computational Zero-Knowledge Systems for QMIP∗
- Computational Complexity Theory
- Introduction to the Theory of Complexity
- Implementing Probabilistically Checkable Proofs of Proximity Arnab Bhattacharyya
- Liner2 a Generic Framework for Named Entity Recognition
- Minimax PAC Bounds on the Sample Complexity of Reinforcement Learning with a Generative Model Mohammad Gheshlaghi Azar, Rémi Munos, Hilbert Kappen
- BQP and the Polynomial Hierarchy
- Computational Complexity
- Problem Book
- Enumeration of the Monomials of a Polynomial and Related Complexity Classes
- The Complexity Class Conp
- (Non-)Hardness of Circuit Minimization and Related Problems
- Complexity of PL Manifolds
- Dspace 1.8 Documentation
- Generalized Homogeneous Polynomials for Efficient Template
- Reinforcement Learning Lecture 3: RL Problems, Sample Complexity and Regret
- Unification of the Nature's Complexities Via a Matrix Permanent—Critical Phenomena, Fractals, Quantum Computing, P-Complex
- NP-Completeness Part One
- Probabilistic Checking of Proofs and Hardness of Approximation Problems
- Probabilistically Checkable Proofs DRAFT 1 Interactive Proof Systems
- The Complexity of Linear Programming*
- Kernel-Size Lower Bounds: the Evidence from Complexity Theory
- Risk Bounds and Rademacher Complexity in Batch Reinforcement Learning
- Upgrading from Dspace 5.5 to Dspace 6.2 Using XMLUI Nason Bimbe September 2017
- Improving Thread-Modular Abstract Interpretation 3 and Is Also Used Extensively for the Verification of Concurrent Systems Via Separa- Tion Logic [3, 14, 15, 17]
- A Clari Cation Concerning the L Hierarchy 1 the Proof
- The Complexity of the Inertia
- Recognizing Maximal Unfrozen Graphs with Respect to Independent Sets Is CO-NP-Complete
- A XML Schema Mappings: Data Exchange and Metadata Management
- Lecture 3: Bounded Error Quantum Polynomial Time (BQP) Contents 1
- Lecture 13 13.1 Nondeterministic Polynomial Time
- Probabilistically Checkable Proofs and Their Consequences for Approximation Algorithms
- Arxiv:1907.04243V1 [Cs.PL] 3 Jul 2019 OCPOETANR-15-CE40-0014
- L4 Complexity Theory I
- Lecture 3: Interactive Proofs and Zero Knowledge 1 Overview 2 Proofs
- Exact Counting of Euler Tours for Generalized Series-Parallel Graphs ∗ Prasad Chebolu A, ,1, Mary Cryan B,2, Russell Martin A,1
- CLARIN-PL-Language-Technology
- Probabilistically Checkable Proofs
- COMPLEXITY of SIMPLICIAL HOMOLOGY and INDEPENDENCE COMPLEXES of CHORDAL GRAPHS 1. Introduction the Main Purpose of This Paper Is
- Probabilistically Checkable Arguments
- Computational Complexity
- Video Playback Modifications for a Dspace Repository
- A P-Complete Problem and Approximations to It
- On the Sample Complexity of Reinforcement Learning with a Generative Model
- Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication
- Constant Rate Pcps for Circuit-SAT with Sublinear Query Complexity
- P-COMPLETE PROBLEMS and APPROXIMATE SOLUTIONS Sartaj
- Composition of Low-Error 2-Query Pcps Using Decodable Pcps∗
- Notes on Zero Knowledge 1 Interactive Proofs
- Enumeration of the Monomials of a Polynomial
- Advanced Complexity Theory Lecture Notes
- Batch Loading Collections Into Dspace: Using Perl Scripts for Automation and Quality Control Maureen P
- Foundation of Cryptography, Lecture 6 Interactive Proofs and Zero Knowledge
- Correlative Dark-Field and Photoluminescence Spectroscopy of Individual Plasmon-Molecule Hybrid Nanostructures in a Strong Coupling Regime
- Interactive Proofs for Quantum Computations
- Constant-Round Interactive Proofs for Delegating Computation
- Quantum Interactive Proof Systems Uses Somewhat Different Techniques
- Constant-Round Interactive Proofs for Delegating Computation
- The Decidability of the First-Order Theory of Knuth-Bendix Order
- Fibrator Properties of PL Manifolds
- Completeness in Polylogarithmic Time and Space
- On Closure Properties of Gapl ∗
- Descriptive Complexity and Some Unusual Quantifiers
- On the Sample Complexity of Reinforcement Learning
- BQP and the Polynomial Hierarchy
- Two Useful Measures of Word Order Complexity
- Computational Complexity: a Modern Approach
- On the Complexity of Some Problems in Linear Algebra
- Complexity Classes
- 1 Counting Complexity
- Applied Logic Exercises - Complexity of Satisfiability
- The Computational Complexity Column by Vikraman Arvind Institute of Mathematical Sciences, CIT Campus, Taramani Chennai 600113, India