Problem $A$ is polynomial reducible to problem $B$.

If problem $A$ is NP-hard then problem $B$ is NP-hard

If problem $B$ is NP-hard then problem $A$ is NP-hard

```
First fact is obviously true, but why the second one is false?
```

Skip to content
# surprizing reducibility and challeng on it

Proxies-free.com: 100% Free Daily Proxy Lists Every Day!

Get Free Proxies Every Day

Problem $A$ is polynomial reducible to problem $B$.

If problem $A$ is NP-hard then problem $B$ is NP-hard

If problem $B$ is NP-hard then problem $A$ is NP-hard

```
First fact is obviously true, but why the second one is false?
```

DreamProxies - Cheapest USA Elite Private Proxies
100 Private Proxies
200 Private Proxies
400 Private Proxies
1000 Private Proxies
2000 Private Proxies
ExtraProxies.com - Buy Cheap Private Proxies
Buy 50 Private Proxies
Buy 100 Private Proxies
Buy 200 Private Proxies
Buy 500 Private Proxies
Buy 1000 Private Proxies
Buy 2000 Private Proxies
ProxiesLive
Proxies-free.com
New Proxy Lists Every Day
Proxies123