DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» FP (complexity)
FP (complexity)
Computational Complexity: a Modern Approach
The Complexity Zoo
User's Guide for Complexity: a LATEX Package, Version 0.80
The Classes FNP and TFNP
Total Functions in the Polynomial Hierarchy 11
Optimisation Function Problems FNP and FP
On Total Functions, Existence Theorems and Computational Complexity
Finding Diverse and Similar Solutions in Constraint Programming
Dichotomy Theorems for Generalized Chromatic Polynomials
Introduction to the Theory of Complexity
Rettinger.2272.Pdf (0.3
COMPUTATIONAL COMPLEXITY Contents
An Overview of Computational Complexity
Approximations of Consistent Query Answers 1
Function Operators Spanning the Arithmetical and the Polynomial Hierarchy
Lecture 5: Feb 4, 2015 5.1 Recap 5.2 Classes AC 0,TC0
Toda's Theorem: PH
NP-Completeness, Proof Systems, and Disjoint NP-Pairs
Top View
Introduction to Computational Complexity∗ — Mathematical Programming Glossary Supplement —
Exploits in Concurrency for Boolean Satisfiability
A Solution-Clusters Based Approach to Solve Hard
Incremental FPT Delay
NP-Completeness, Proof Systems, and Disjoint NP-Pairs
The Exact Complexity of the Tutte Polynomial
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
Complexity of Counting
P Versus NP Frank Vega
CONSTRAINT SATISFACTION PROBLEM: a CASE STUDY 1 2 Jyoti , Tarun Dalal
Computational Complexity Theory
Other Complexity Classes and Measures Chapter 29 of the Forthcoming CRC Handbook on Algorithms and Theory of Computation
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
An Algebraic Approach to the Boolean Satisfiability Problem
The Complexity of Equivalence Relations
Introduction to Computational Complexity (Lecture Notes for a 5-Day Graduate Course)
The Complexity of Optimization Problems
Iterated Multiplication in $ VTC^ 0$