Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,702,465 papers from all fields of science

Search

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

Highly Cited

2017

Highly Cited

2017

A bstractMotivated by recent studies of holographic complexity, we examine the question of circuit complexity in quantum field…

Highly Cited

2000

Highly Cited

2000

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

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…

Highly Cited

1994

Highly Cited

1994

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

Highly Cited

1994

Highly Cited

1994

Computers and computation the discrete neuron the Boolean neuron alternating circuits small, shallow alternating circuits…

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…

Review

1993

Review

1993

The basic techniques for using polynomials in complexity theory are examined, emphasizing intuition at the expense of formality…

Highly Cited

1993

Highly Cited

1993

CARBON exhibits a unique ability to form a wide range of structures. In an inert atmosphere it condenses to form hollow…

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…

Highly Cited

1987

Highly Cited

1987

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