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

Search

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

Highly Cited

2011

Highly Cited

2011

Computational complexity theory is the study of the minimal resources needed to solve computational problems. In particular, it…

Highly Cited

2011

Highly Cited

2011

We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical…

Highly Cited

2009

Highly Cited

2009

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory…

Highly Cited

2002

Highly Cited

2002

Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1…

Highly Cited

1997

Highly Cited

1997

In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an…

Highly Cited

1996

Highly Cited

1996

From the Publisher:
Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and…

Highly Cited

1993

Highly Cited

1993

In this dissertation we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an…

Highly Cited

1993

Highly Cited

1993

The book is outstanding and admirable in many respects. ... is necessary reading for all kinds of readers from undergraduate…

Review

1989

Review

1989

We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal…

Highly Cited

1986

Highly Cited

1986

Quantities are defined operationally which qualify as measures of complexity of patterns arising in physical situations. Their…