DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» TC (complexity)
TC (complexity)
Week 1: an Overview of Circuit Complexity 1 Welcome 2
The Complexity Zoo
Glossary of Complexity Classes
Interactive Oracle Proofs with Constant Rate and Query Complexity∗†
User's Guide for Complexity: a LATEX Package, Version 0.80
A Short History of Computational Complexity
TC Circuits for Algorithmic Problems in Nilpotent Groups
Limits to Parallel Computation: P-Completeness Theory
Some NP-Complete Problems
Descriptive Complexity: a Logicians Approach to Computation
Circuit Complexity and Computational Complexity
7. Overview of Modern QMC Algorithms
Computing Quantum Discord Is NP-Complete (Theorem 2)
Generalized Hex and Logical Characterizations of Polynomial Space
Reducibility and Completeness
Computing Rational Radical Sums in Uniform TC0
Definition and Measurement of Complexity in the Context of Safety
On TC Lower Bounds for the Permanent
Top View
Succinct Malleable Nizks and an Application to Compact Shuffles
Lecture 5: Feb 4, 2015 5.1 Recap 5.2 Classes AC 0,TC0
Lecture 5 & 6 1 Threshold Functions and TC
Probabilistic Checking of Proofs and Hardness of Approximation Problems
Languages That Capture Complexity Classes Introduction
Descriptive Complexity
Smooth and Strong Pcps∗
Finding Reductions Automatically
Regular Representations of Uniform $TC^0
Geppetto: Versatile Verifiable Computation
NP-Completeness Results for Some Problems on Subclasses of Bipartite and Chordal Graphs
Theories for Tc0 and Other Small Complexity Classes 1
MSR Redmond, 8/26/15
A Short History of Computational Complexity
New Surprises from Self-Reducibility
L4 Complexity Theory I
Limits to Parallel Computation: P-Completeness Theory
Fast Approximate Probabilistically Checkable Proofs ⋆
CMS-209 Laboratory Personnel Report (CLIA)
Quantified Derandomization of Linear Threshold Circuits
Computing Kernels in Parallel: Lower and Upper Bounds
Complexity Classes Chapter 27 of the Forthcoming CRC Handbook on Algorithms and Theory of Computation
Corrigendum for Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication
Non-Interactive Zaps and New Techniques for NIZK
Arxiv:1204.3513V2
Interactive Oracle Proofs with Constant Rate and Query Complexity
A Circuit Uniformity Sharper Than Dlogtime Guillaume Bonfante, Virgile Mogbil
A Note on the Power of Threshold Circuits
Lecture 12: Circuit Complexity
Defining and Assessing Chinese Syntactic Complexity
Cryptographic Reverse Firewalls for Interactive Proof Systems
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
Pcps for Arthur-Merlin Games and Communication Protocols by Andrew Donald Drucker
A Second Order Theory for TC0
Recent Developments on Circuit Satisfiability Algorithms
Interactive Proofs for Quantum Computations
Expressivity Within Second-Order Transitive-Closure Logic
Lecture 14: PSPACE
NP-Completeness Results for Partitioning a Graph Into Total Dominating Sets
Lecture 6: Arithmetic and Threshold Circuits 1. Overview
The Complexity of Theorem-Proving Procedures∗
On the Complexity of HTN Plan Verification and Its Implications For
Lecture 9: PSPACE
Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions
NP-Complete Problems
Chapter 5 Proof-Carrying Data Systems
A Compendium of Problems Complete for P
Complexity Classes Saying Whether the Formula Is Valid, Requires at Least 10123 Gates
Computing Rational Radical Sums in Uniform TC0
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
A Brief Survey of Inductive Descriptive Complexity
A Hybrid Architecture for Interactive Verifiable Computation
PSPACE-Completeness of Bloxorz and of Games with 2- Buttons