962 search results - page 5 / 193 » Some Reducibilities on Regular Sets |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
COCO
1991
Springer
13 years 11 months ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
This is a survey of some theoretical results on boosting obtained from an analogous treatment of some regression and classi cation boosting algorithms. Some related papers include...
ISVLSI
2007
IEEE
14 years 1 months ago
2007
IEEE
— Y -interconnects for VLSI chips are based on the use of global and semi-global wiring in only 0◦ , 60◦ , and 120◦ . Though X-interconnects are fast replacing the traditio...
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...