Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,094,117 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.
2019
2019
Tomorrow’s geotechnical toolbox: EN 1997-1:202x General rules
G. Franzén
,
Marcos Arroyo Álvarez de Toledo
,
+4 authors
A. Bond
2019
Corpus ID: 216674593
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
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. E. Porreca
,
Niall Murphy
,
Mario de Jesús Pérez 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
2004
2004
Fine-Grained MSR Specifications for Quantitative Security Analysis
I. Cervesato
2004
Corpus ID: 5013917
The traditional Dolev-Yao model of security limits attacks to “computationally feasible” operations. We depart from this model by…
Expand
1998
1998
First-Order Closure and the Monadic Second-Order Alternation Hierarchy
O. 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
1996
1996
Class & class conflict in Australia
Rick Kuhn
,
Tom O’Lincoln
1996
Corpus ID: 153262588
1994
1994
Placing Feedforward Neural Networks Among Several Circuit Complexity Classes
Valeriu Beiu
,
J. Peperstraete
,
J. Vandewalle
,
R. Lauwereins
1994
Corpus ID: 17007415
This paper examines the circuit complexity of feedforward neural networks having sigmoid activation function. The starting point…
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
1987
1987
Riccati matrix differential equation and classification of disconjugate differential systems
O. Došlý
1987
Corpus ID: 55963424
Classification of disconjugate differential systems is established. It is shown that every disconjugate differential system…
Expand