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

2016

Highly Cited

2016

Despite recent reports of high power conversion efficiency (PCE) values of over 20%, the instability of perovskite solar cells… Expand

Is this relevant?

Highly Cited

2016

Highly Cited

2016

As a follow-on work of the authors’ theoretical study, the paper presented an experimental investigation into the energy… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

Abstract We place the geological history since Cretaceous times in western Turkey in a context of convergence, subduction… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

In this paper, we present a multi-surrogates assisted memetic algorithm for solving optimization problems with computationally… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

We show that for each k> 0, MA/ 1( MA with 1 bit of advice) does not have circuits of size n k . This implies the first… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Abstract.We initiate the study of the computational complexity of the covering radius problem for lattices, and approximation… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

We establish hardness versus randomness trade-offs for a broad class of randomized procedures. In particular, we create efficient… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We show that the shortest vector problem in lattices with La norm is NP-hard for randomized reductions. Moreover we also show… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

Is this relevant?