Highly Influenced

# P , NP and mathematics – a computational complexity perspective

@inproceedings{Smale2006PN, title={P , NP and mathematics – a computational complexity perspective}, author={Steve Smale}, year={2006} }

- Published 2006

The P versus NP question distinguished itself as the central question of theoretical computer science nearly four decades ago. The quest to resolve it, and more generally, to understand the power and limits of efficient computation, has led to the development of computational complexity theory. While this mathematical discipline in general, and the P vs. NP problem in particular, have gained prominence within the mathematics community in the past decade, it is still largely viewed as a problem… CONTINUE READING

Highly Cited

This paper has 49 citations. REVIEW CITATIONS

#### Statistics

Citations per Year

#### Citation Velocity: 5

Averaging **5 citations** per year over the last 3 years.

**FAQ**.

Showing 1-10 of 97 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential