
PhD學校跟成世 除非你讀住再報 如果唔係就
我個field都係德國佬做多
唔係好擔心
PhD學校跟成世 除非你讀住再報 如果唔係就
我個field都係德國佬做多
唔係好擔心
我個間ranking都無![]()
Btw你咁早起身
我個間ranking都無![]()
Btw你咁早起身
要搵食有乜計![]()
我master個間同你個間都係玩area specific, general ranking低因為無其他stem科
我個間ranking都無![]()
Btw你咁早起身
要搵食有乜計![]()
我master個間同你個間都係玩area specific, general ranking低因為無其他stem科
係subject specific 唔係area specific![]()
![]()
PhD學校跟成世 除非你讀住再報 如果唔係就
HKU Math
我有個frd 間startup 請咗個princeton maths PhD 剩係睇個program generate 出嚟兩個地點之間條path 係唔係最optimized
travelling salesman problem啲friend![]()
Yes. NP-complete problem!
HKU Math
我有個frd 間startup 請咗個princeton maths PhD 剩係睇個program generate 出嚟兩個地點之間條path 係唔係最optimized
travelling salesman problem啲friend![]()
Yes. NP-complete problem!
有咩慘得過老細連NP Hard Complexity係乜都唔知
淨係叫我出OR paper比佢
大家有無呢個問題? 基本上我老細完全唔識我做既field 佢既功能就係得閒摔下我交數 寫paper幫佢交project UGC數
HKU Math
我有個frd 間startup 請咗個princeton maths PhD 剩係睇個program generate 出嚟兩個地點之間條path 係唔係最optimized
travelling salesman problem啲friend![]()
Yes. NP-complete problem!
有咩慘得過老細連NP Hard Complexity係乜都唔知
淨係叫我出OR paper比佢
大家有無呢個問題? 基本上我老細完全唔識我做既field 佢既功能就係得閒摔下我交數 寫paper幫佢交project UGC數
HKU Math
我有個frd 間startup 請咗個princeton maths PhD 剩係睇個program generate 出嚟兩個地點之間條path 係唔係最optimized
travelling salesman problem啲friend![]()
Yes. NP-complete problem!
有咩慘得過老細連NP Hard Complexity係乜都唔知
淨係叫我出OR paper比佢
大家有無呢個問題? 基本上我老細完全唔識我做既field 佢既功能就係得閒摔下我交數 寫paper幫佢交project UGC數
HKU Math
我有個frd 間startup 請咗個princeton maths PhD 剩係睇個program generate 出嚟兩個地點之間條path 係唔係最optimized
travelling salesman problem啲friend![]()
Yes. NP-complete problem!
有咩慘得過老細連NP Hard Complexity係乜都唔知
淨係叫我出OR paper比佢
大家有無呢個問題? 基本上我老細完全唔識我做既field 佢既功能就係得閒摔下我交數 寫paper幫佢交project UGC數
十年無用過R
啱啱用唻做computation plot張graph
搞左我兩個幾鐘![]()