Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2010

Highly Cited

2010

Gentry proposed a fully homomorphic public key encryption scheme that uses ideal lattices. He based the security of his scheme on… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

We present a new strategy for calibration and validation of hierarchical multiscale models based on computational homogenization… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Accurate Computational Fluid Dynamics (CFD) simulations of atmospheric boundary layer (ABL) flow are essential for a wide variety… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Abstract.Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators from a uniform complexity… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

This paper presents a three-move interactive identification scheme and proves it to be as secure as the discrete logarithm… Expand

Is this relevant?

Highly Cited

1989

Highly Cited

1989

Abstract The paper studies effective approximate solutions to combinatorial counting and unform generation problems. Using a… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

Abstract The class of problems involving the random generation of combinatorial structures from a uniform distribution is… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

Abstract P-selective sets are used to distinguish polynomial time-bounded reducibilities on NP. In particular, we consider… Expand

Is this relevant?