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.

Review

2019

Review

2019

Pt-Based electrocatalysts with high atom utilization efficiency: from nanostructures to single atoms

In recent years, development to increase the performance of Pt-based catalysts and reduce the cost has received significant… Expand

Is this relevant?

Review

2019

Review

2019

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field… Expand

Is this relevant?

Review

2018

Review

2018

Adequate statistical power contributes to observing true relationships in a dataset. With a thoughtful power analysis, the… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

From the Publisher:
This advanced handbook presents a broad and up-to-date view of the computational complexity theory of… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

▪ Abstract Solution phase syntheses and size-selective separation methods to prepare semiconductor and metal nanocrystals… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Part 1 Mathematical preliminaries: words and languages automata and regular languages semigroups and homomorphisms. Part 2 Formal… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fan-in… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that cliques in graphs. In particular, Razborov… Expand

Is this relevant?