Skip to search formSkip to main contentSkip to account menu

Complexity class

Known as: Computational complexity classes, Time-complexity class, Complexity classes 
In computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AC (complexity)AC0AWPP (complexity)Abstract machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Minimal Cooperation in P Systems with Symport/Antiport: A Complexity Approach
1 Research Group on Natural Computing Department of Computer Science and Artificial Intelligence Universidad de Sevilla Avda… 
2014
2014
Impossibility of Classically Simulating One-Clean-Qubit Computation
2013
2013
CroMatcher results for OAEI 2016
CroMatcher is an ontology matching system based on terminological and structural matchers. The most important part of the system… 
2012
2012
An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Division
Summary. In the framework of tissue P systems with cell division, the length of communication rules provides a frontier for the… 
2001
2001
Developing applications with Java and UML : プログラマーのための統一モデリング
第１章 プロジェクトのジレンマ 第２章 Ｊａｖａ、オブジェクト指向分析・設計、ＵＭＬ 第３章 プロジェクトの開始 第４章 ユースケース 第５章 クラス 第６章 ユーザインタフェースのプロトタイプの構築 第７章 アプリケーションの動的要素 第８章 技術展望 第９章 オブジェクトの格納：データの永続性 第１０章 インフラとアーキテクチャのレビュー 第１１章 サーブレット、ＪＳＰ、ＪａｖａＢｅａｎによる構築 第１２章 サーブレット、ＪＳＰ、ＥＪＢによる構築 
1999
1999
Complexity theoretical results for randomized branching programs
This work is settled in the area of complexity theory for rest icted variants of branching programs. Today, branching programs… 
1998
1998
First-Order Closure and the Monadic Second-Order Alternation Hierarchy
The rst-order closure of a class F of formulas is the smallest superclass of F that is closed under rst-order quantiication. We… 
1992
1992
The coincidence Nielsen number for maps into real projective spaces
We give an algorithm to compute the coincidence Nielsen number N(f, g), introduced in [DJ], for pairs of maps into real… 
1986
1986
Complete sets and closeness to complexity classes
We consider two setsA andB to be close to each other if the census of their symmetric difference,A ▵B, is a slowly increasing… 
1969
1969
Dense and Non-Dense Families of Complexity Classes
Let Φ be any abstract measure of computational complexity, and let L denote the specific measure of memory resource (tape) on one… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)