Ogiwara and Watanabe showed that if SAT is bounded truth-table reducible to a sparse set, then P = NP. In this paper we simplify their proof, strengthen the result and use it to obtain several new results. Among the new results are the following: β’ Applications of the main theorem to log-truth-tabl
β¦ LIBER β¦
Reductions of additive sets, sets of uniqueness and pyramids
β Scribed by Ernesto Vallejo
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 860 KB
- Volume
- 173
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On reductions of NP sets to sparse sets
β
Steven Homer; Luc LongprΓ©
π
Article
π
1994
π
Elsevier Science
π
English
β 678 KB
Sets of Uniqueness and Minimal Matrices
β
Adolfo Torres-ChΓ‘zaro; Ernesto Vallejo
π
Article
π
1998
π
Elsevier Science
π
English
β 142 KB
In this note we give an algebraic characterization of sets of uniqueness in terms of matrices with non-negative integer coefficients and prescribed row and column sums, and of the dominance order of partitions or majorization. Our proof uses some identities involving characters of the symmetric grou
On sets of range uniqueness
β
Elgin H. Johnston
π
Article
π
1983
π
Springer-Verlag
π
French
β 577 KB
Compact sets of additive measures
β
S. G. Bobkov
π
Article
π
1984
π
Springer US
π
English
β 250 KB
Sets of uniqueness for Haar series
β
W. R. Wade
π
Article
π
1977
π
Akadmiai Kiad
π
English
β 848 KB
P-adic sets of range uniqueness
β
Kamal Boussaf
π
Article
π
2007
π
Springer Milan
π
Italian
β 125 KB