NC (complexity)

Known as: NC = P problem, BWBP, NC1 (complexity) 
In complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1964-2017
0204019642017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an l-bit public index pind and a message m, and a… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted data… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
F the few scientists who earn a Nobel prize, the impact and relevance of their research is unquestionable. Among the rest of us… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Technical terms (henceforth called terms ), are important elements for digital libraries. In this paper we present a domain… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The area of “computing with encrypted data” has been studied by numerous authors in the past twenty years since it is fundamental… (More)
Is this relevant?
1995
1995
We examine the computational power of modular counting, where the modulus m is not a prime power, in the setting of polynomials… (More)
Is this relevant?
1989
1989
We consider the relative complexity of a number of languages known to be in uniform NC’, using the descriptive framework of… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We show that, over an arbitrary ring, the functions computed by polynomial-size algebraic formulas are also computed by… (More)
Is this relevant?
1987
1987
We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G… (More)
Is this relevant?