Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem

Overview of attention for article published in Journal of Computer & System Sciences, October 1998

Altmetric Badge

About this Attention Score

Above-average Attention Score compared to outputs of the same age (62nd percentile)
High Attention Score compared to outputs of the same age and source (80th percentile)

Mentioned by

wikipedia: 4 Wikipedia pages

q&a: 1 Q&A thread

Readers on

mendeley: 16 Mendeley

So far, Altmetric has seen 4 citations on 4 Wikipedia pages.

Romanian

NP-completitudine

Cited by user Andrei Stroe on 25 May 2017

dreapta|miniatura|300x300px|[[Diagramă Euler pentru mulțimile de probleme P, NP, NP-complete, și NP-dure.

French

Steven Rudich

Cited by user ManiacParisien on 21 Feb 2016

English

Steven Rudich

Cited by user Mareino on 16 Sep 2010

Steven Rudich (born October 4, 1961) is a professor in the Carnegie Mellon School of Computer Science.

English

NP-complete

Cited by user Citation bot 1 on 11 Sep 2010

Although any given solution to an NP-complete problem can be verified quickly (in polynomial time), there is no known efficient way to locate a solution in the first…

This page shows the most recent Wikipedia articles that mention this research output. Click here to find out how to access more activity.