Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,118,097 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.
2016
2016
Gravitational Approach for Point Set Registration
Vladislav Golyanik
,
Sk Aziz Ali
,
D. Stricker
Computer Vision and Pattern Recognition
2016
Corpus ID: 6096272
In this paper a new astrodynamics inspired rigid point set registration algorithm is introduced-the Gravitational Approach (GA…
Expand
2012
2012
Size complexity of rotating and sweeping automata
Christos A. Kapoutsis
,
Richard Královic
,
Tobias Mömke
Journal of computer and system sciences (Print)
2012
Corpus ID: 20700026
Review
2010
Review
2010
Land Capability Classification For Land Evaluation : A Review
S. Sitorus
2010
Corpus ID: 56415854
Land capability classification has been used for land evaluation for various purposes in many countries in the world. Since…
Expand
2010
2010
Experimental assessment of combining pattern matching strategies with VIATRA2
Á. Horváth
,
Gábor Bergmann
,
I. Ráth
,
Dániel Varró
International Journal on Software Tools for…
2010
Corpus ID: 14018894
As recent tool contests demonstrated graph transformation tools scale up to handle very large models for model transformations…
Expand
Highly Cited
2007
Highly Cited
2007
Class-Specific Kernel-Discriminant Analysis for Face Verification
Georgios Goudelis
,
S. Zafeiriou
,
A. Tefas
,
I. Pitas
IEEE Transactions on Information Forensics and…
2007
Corpus ID: 12617809
In this paper, novel nonlinear subspace methods for face verification are proposed. The problem of face verification is…
Expand
2006
2006
Universal Zero-Delay Joint Source–Channel Coding
S. Matloub
,
T. Weissman
IEEE Transactions on Information Theory
2006
Corpus ID: 15031406
We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary…
Expand
2004
2004
On the reducibility of sets inside NP to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of computer and system sciences (Print)
2004
Corpus ID: 11030898
2003
2003
An Ontology-based Architecture for Cooperative Information Agents
F. Freitas
,
G. Bittencourt
International Joint Conference on Artificial…
2003
Corpus ID: 17315691
In the Web, extractor agents process classes of pages (like 'call for papers' pages, researchers' pages, etc), neglecting the…
Expand
1997
1997
Self-similar Spherical Collapse Revisited: A Comparison between Gas and Dark Matter Dynamics
R. Teyssier
,
J. Chièze
,
Jean-Michel Alimi Service d'Astrophysique CEA-SACLAY
,
France Laec
,
O. Meudon
,
France.
1997
Corpus ID: 14139813
We reconsider the collapse of cosmic structures in an Einstein-de Sitter universe, using the self-similar initial conditions of…
Expand
1994
1994
On the node complexity of neural networks
B. Horne
,
D. Hush
Neural Networks
1994
Corpus ID: 931652
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)
ACCEPT & CONTINUE