45,089 research outputs found
A study of listing PRC enterprises in Hong Kong stock exchange.
No full textby Chan Kin Man, Eric, Ng Man Leung, Alfred, Poon Man Ching, Daniel.Thesis (M.B.A.)--Chinese University of Hong Kong, 1989.Bibliography: leaves [113]-[115]
Active control of sound in ducts
No full textSIGLEAvailable from British Library Document Supply Centre-DSC:DX199451 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Biao mian dian he jie pu yi
No full textby Raymon, Wai-man Chan."March 1999."Thesis (Ph.D.)--Chinese University of Hong Kong, 1999.Includes bibliographical references.Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.Mode of access: World Wide Web.Abstracts in English and Chinese.by Raymon, Wai-man Chan
Hardness of Approximation in PSPACE and Separation Results for Pebble Games
No full textWe consider the pebble game on DAGs with bounded fan-in introduced in [Paterson and Hewitt '70] and the reversible version of this game in [Bennett '89], and study the question of how hard it is to decide exactly or approximately the number of pebbles needed for a given DAG in these games. We prove that the problem of deciding whether s pebbles suffice to reversibly pebble a DAG G is PSPACE-complete, as was previously shown for the standard pebble game in [Gilbert, Lengauer and Tarjan '80]. Via two different graph product constructions we then strengthen these results to establish that both standard and reversible pebbling space are PSPACE-hard to approximate to within any additive constant. To the best of our knowledge, these are the first hardness of approximation results for pebble games in an unrestricted setting (even for polynomial time). Also, since [Chan '13] proved that reversible pebbling is equivalent to the games in [Dymond and Tompa '85] and [Raz and McKenzie '99], our results apply to the Dymond - Tompa and Raz - McKenzie games as well, and from the same paper it follows that resolution depth is PSPACE-hard to determine up to any additive constant. We also obtain a multiplicative logarithmic separation between reversible and standard pebbling space. This improves on the additive logarithmic separation previously known and could plausibly be tight, although we are not able to prove this. We leave as an interesting open problem whether our additive hardness of approximation result could be strengthened to a multiplicative bound if the computational resources are decreased from polynomial space to the more common setting of polynomial time.</p
Marketing strategies of the Hong Kong ready-mix concrete suppliers.
No full textby Chan Man Cheong Andrew.Thesis (M.B.A.)--Chinese University of Hong Kong, 1987.Bibliography: leaf 78
The specific heat of composite material at low temperatures.
No full textby Chan Man-ng.Thesis (M.Ph.)--Chinese University of Hong Kong.Bibliography: l. 108
A study of branch banking in the New Territories : examining the potential for expansion of bank facilities into this area : research paper.
No full textby Chan Man Fai.Bibliography: leaves 45-47Thesis (M.B.A.)--Chinese University of Hong Kong, 198
AI, data and private law: The theory-practice interface
No full textNational Research Foundation (NRF) Singapore under Emerging Areas Research Projects (EARP) Funding Initiativ
CUHK electronic theses & dissertations collection
No full textChan, Sau Man Conny.Thesis D.Nurs. Chinese University of Hong Kong 2014.Includes bibliographical references (leaves 204-221).Abstracts and some appendixes also in Chinese.Title from PDF title page (viewed on 21, December, 2016)
- …
