Are there any known barriers to some approach for solving P vs. NP?
Posted by Steffen Schuler, at math.stackexchange.com,
Are there any known barriers to show the following invariant (perhaps by some sort of induction)? Let $\Sigma$ be some finite…
Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
Overview of attention for article published in SIAM Journal on Computing, July 2006
Altmetric Badge
About this Attention Score
-
In the top 25% of all research outputs scored by Altmetric
-
High Attention Score compared to outputs of the same age (89th percentile)
-
High Attention Score compared to outputs of the same age and source (84th percentile)
Readers on
- mendeley
- 24 Mendeley