Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,531 papers from all fields of science
Search
Sign In
Create Free Account
Complexity class
Known as:
Computational complexity classes
, Time-complexity class
, Complexity classes
Expand
In computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AC (complexity)
AC0
AWPP (complexity)
Abstract machine
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Adiabatic flip-flops and sequential circuit design using novel resettable adiabatic buffers
S. Maheshwari
,
V. A. Bartlett
,
I. Kale
European Conference on Circuit Theory and Design
2017
Corpus ID: 5774832
We propose novel resettable adiabatic buffers for five adiabatic logic families namely; Efficient Adiabatic Charge Recovery Logic…
Expand
2015
2015
Minimal Cooperation in P Systems with Symport/Antiport: A Complexity Approach
L. V. Cabrera
,
Bosheng Song
,
L. F. Ramos
,
Linqiang Pan
,
A. Núñez
,
M. J. P. Jiménez
2015
Corpus ID: 16975071
1 Research Group on Natural Computing Department of Computer Science and Artificial Intelligence Universidad de Sevilla Avda…
Expand
2014
2014
Impossibility of Classically Simulating One-Clean-Qubit Computation
Keisuke Fujii
,
Hirotada Kobayashi
,
T. Morimae
,
H. Nishimura
,
S. Tamate
,
S. Tani
arXiv.org
2014
Corpus ID: 263442730
2013
2013
CroMatcher results for OAEI 2016
M. Gulić
,
B. Vrdoljak
,
M. Banek
OM@ISWC
2013
Corpus ID: 2766894
CroMatcher is an ontology matching system based on terminological and structural matchers. The most important part of the system…
Expand
2013
2013
Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms
J. Brzozowski
,
Gareth Davies
arXiv.org
2013
Corpus ID: 12557035
We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the…
Expand
2012
2012
An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Division
A. Porreca
,
Niall Murphy
,
M. J. P. Jiménez
2012
Corpus ID: 17432122
Summary. In the framework of tissue P systems with cell division, the length of communication rules provides a frontier for the…
Expand
2001
2001
Developing applications with Java and UML : プログラマーのための統一モデリング
Paul R. Reed
,
テクノロジックアート
,
長瀬 嘉秀
,
今野 睦
2001
Corpus ID: 60033211
第１章 プロジェクトのジレンマ 第２章 Ｊａｖａ、オブジェクト指向分析・設計、ＵＭＬ 第３章 プロジェクトの開始 第４章 ユースケース 第５章 クラス 第６章 ユーザインタフェースのプロトタイプの構築 第７章 アプリケーションの動的要素 第８章 技術展望 第９章 オブジェクトの格納：データの永続性 第１０章 インフラとアーキテクチャのレビュー 第１１章 サーブレット、ＪＳＰ、ＪａｖａＢｅａｎによる構築 第１２章 サーブレット、ＪＳＰ、ＥＪＢによる構築
1999
1999
Complexity theoretical results for randomized branching programs
Martin Sauerhoff
1999
Corpus ID: 12511056
This work is settled in the area of complexity theory for rest icted variants of branching programs. Today, branching programs…
Expand
1992
1992
The coincidence Nielsen number for maps into real projective spaces
J. Jezierski
1992
Corpus ID: 1941476
We give an algorithm to compute the coincidence Nielsen number N(f, g), introduced in [DJ], for pairs of maps into real…
Expand
1986
1986
Complete sets and closeness to complexity classes
U. Schöning
Mathematical Systems Theory
1986
Corpus ID: 536020
We consider two setsA andB to be close to each other if the census of their symmetric difference,A ▵B, is a slowly increasing…
Expand