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)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2013

Highly Cited

2013

- Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
- STOC
- 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

- Craig Gentry
- STOC
- 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

- Jorge E. Hirsch
- 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)

Is this relevant?

2001

Highly Cited

2000

Highly Cited

2000

- Katerina T. Frantzi, Sophia Ananiadou, Hideki Mima
- International Journal on Digital Libraries
- 2000

Technical terms (henceforth called terms ), are important elements for digital libraries. In this paper we present a domain… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Tomas Sander, Adam L. Young, Moti Yung
- FOCS
- 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

- Gábor Tardos, David A. Mix Barrington
- computational complexity
- 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

- David A. Mix Barrington, James C. Corbett
- Inf. Process. Lett.
- 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

- Michael Ben-Or, Richard Cleve
- STOC
- 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

- László Babai, Eugene M. Luks, Ákos Seress
- STOC
- 1987

We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G… (More)

Is this relevant?