#### DMCA

## Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses (2010)

### Cached

### Download Links

- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [cgis.cs.umd.edu]
- [cgis.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [cgis.cs.umd.edu]
- [cgis.cs.umd.edu]
- [www.stanford.edu]
- [pages.cs.wisc.edu]
- [pages.cs.wisc.edu]

by
Holger Dell
,
Dieter van Melkebeek

Venue: | ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 38 (2010) |

Citations: | 51 - 2 self |