DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Low (complexity)
Low (complexity)
Notes for Lecture 2
The Complexity Zoo
When Subgraph Isomorphism Is Really Hard, and Why This Matters for Graph Databases Ciaran Mccreesh, Patrick Prosser, Christine Solnon, James Trimble
Glossary of Complexity Classes
Group, Graphs, Algorithms: the Graph Isomorphism Problem
Complexity, Part 2 —
The Computational Complexity Column by V
Reduction of the Graph Isomorphism Problem to Equality Checking of N-Variables Polynomials and the Algorithms That Use the Reduction
PSPACE-Completeness & Savitch's Theorem 1 Recap
NP-Completeness, Conp, P /Poly and Polynomial Hierarchy
About a Low Complexity Class of Cellular Automata Pierre Tisseur
Some Estimated Likelihoods for Computational Complexity
Computational Complexity
The Computational Complexity Column
Lower Bounds for Subgraph Isomorphism
Quantum Complexity Theory
BQP and the Polynomial Hierarchy
Permutation Groups and the Graph Isomorphism Problem
Top View
Graph Isomorphism Is Low for Pp
IIT Kharagpur 1 P, NP, Conp and Complete Problems
Bandwidth Efficient and Rate-Matched Low-Density Parity
Space and Nondeterminism 1 Topic Overview 2 PSPACE = NPSPACE = Conpspace
Circuit Complexity Before the Dawn of the New Millennium 62
Computational Complexity Theory
Computing Complete Graph Isomorphisms and Hamiltonian
Introduction to Computational Complexity∗ — Mathematical Programming Glossary Supplement —
BU CS 332 – Theory of Computation
EXPTIME Hardness of an N by N Custodian Capture Game
A. Definitions of Reductions and Complexity Classes, and Notation List
Bpp Has Subexponential Time Simulations Unless Exptime Has Publishable Proofs
Complexity Relative to an Oracle
Generalized Lowness and Highness and Probabilistic Complexity Classes
Complexity Limitations on Quantum Computation 1 Introduction
Complexity Theory Part II
On the Complexity and Verification of Random Circuit Sampling Chinmay Nirkhe
[email protected]
Joint Work With
Other Complexity Classes and Measures Chapter 29 of the Forthcoming CRC Handbook on Algorithms and Theory of Computation
Recent Advances in Complexity Theory
Introduction to Complexity Theory
Kolmagorav Complexity, Complexity Cores, and the Distribution of Hardness David W
Non-Deterministic Quasi-Polynomial Time Is Average-Case Hard for ACC Circuits
Towards a Study of Low-Complexity Graphs*
An Exptime Upper Bound for ALC with Integers
My Favorite Ten Complexity Theorems of the Past Decade
Two Remarks on the Local Hamiltonian Problem
Defeasible Inclusions in Low-Complexity Dls: Preliminary Notes
Low-Density Parity-Check Codes : Unequal Error Protection And
Another Proof That BPP ⊆ PH (And More)
NP Completeness
NP with Small Advice
Towards NEXP Versus BPP?
Recent Advances Towards Proving P =
BQP and the Polynomial Hierarchy
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
Computational Complexity: a Modern Approach
Probabilistic Complexity Classes and Lowness
BQP and PH Avishay Tal (Stanford University) Joint with Ran Raz (Princeton University)
Low-Complexity Cryptographic Hash Functions∗
1 Counting Complexity
The Complexity of Approximating PSPACE-Complete
On the Space Complexity of Parameterized Problems∗
Avishay Tal (Stanford, Simons Institute) Joint with Ran Raz (Princeton University) the Landscape of Complexity Classes PSPACE