Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,792,069 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.
Review
2017
Review
2017
Consensus statements and clinical recommendations on treatment indications , surgical procedures , prosthetic protocols and complications following AllOn-4 standard treatment
M. Peñarrocha-Diago
,
M. Peñarrocha-Diago
,
Regino Zaragozí-Alonso
,
David Soto-Peñaloza
2017
Corpus ID: 45839872
Objectives: The present consensus report critically evaluates the scientific evidence based on a comprehensive systematic review…
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
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
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
2012
2012
An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Division
A. Porreca
,
Niall Murphy
,
M. 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
Review
2010
Review
2010
Provable Security for Physical Cryptography ⋆
Krzysztof Pietrzak
2010
Corpus ID: 18124933
The modern approach to cryptography is provable security, where one defines a meaningful formal security model and proves that…
Expand
1999
1999
Feature interaction as a satisfiability problem
C. Areces
,
W. Bouma
,
M. de Rijke
MASCOTS '99. Proceedings of the Seventh…
1999
Corpus ID: 15626400
We present a formal model for the specification of telephone features by means of description logics. Our framework permits the…
Expand
1998
1998
First-Order Closure and the Monadic Second-Order Alternation Hierarchy
Oliver Matz
1998
Corpus ID: 117990972
The rst-order closure of a class F of formulas is the smallest superclass of F that is closed under rst-order quantiication. We…
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