Regard 20 centuries as one of inventions of the most advanced science and technology, the computer already caused deep society to change, make the indispensable component in social life. Formed research computer to reach around the computer all sorts of phenomena are mixed all round its regular science. Among them, academic computer science involves many maths content because of its, conduce to learner profundity and understand the essence of the problem intuitionisticly, wide suffer praise highly. Lin Bingkai of professor of Nanjing university computer science department chooses " the parameter complexity in theory of contemporary computation complexity and careful complexity " regard specific research as the domain, around theory of contemporary computation complexity, undertake more careful depict and classification to approximate calculative complexity this one masterstroke, do not change from beginning to end first heart, become the person above average in investigator of science of a lot of and academic computer.
Hold trend development in order to overcome difficult
The trend of a development of theory of contemporary computation complexity, undertake more careful depict and classification to computational complexity namely: The specific computational complexity that shows on the input that pays close attention to computational problem to reach parameter in specific structure, and the accurate computational expense of computational problem. Help people understand accurately thereby " computational problem because why and easy, because of why and difficult " -- this also is computation the tenet since theory is born oneself. Parameter complexity and careful complexity allot theory of exhibiting contemporary computation complexity in this one setting namely. The discovery of a milepost type in passing statistic to consider complexity academic to consider is PCP theory (probability can examine proof) reach its to understanding cannot the action of approximate sex. To it corresponding, in research of theory of contemporary computation complexity, also want to face serious challenge, namely the PCP of careful complexity and parameter complexity version is academic.
Lin Bingkai teachs grant his research domain become attached to, only then at reading ACM of Shanghai traffic university when pilot class. Be in 2006, 2013, he was assiduously studied " computer science and technology " bachelor, master's degree, ceaseless development understands parameter complexity theory, its Master paper is namely " K edge is revulsive child the parameter complexity of attempt issue " . The public problem that there is a long-term suspense in parameter complexity domain -- K-BICLIQUE problem.
The inaugurator Downey of parameter complexity, rodG. With Fellows, michaelR. This call the problem in the schoolbook of their compose " the course is so many year still did not settle the one large in a difficult position that is whole field however " . Professor Lin Bingkai solved this one problem alone during assiduously studying a doctor's degree, it is important to publish positive result publish positive result at international algorithm with alone author thesis conference SODA ' 15, won the optimal paper award with this period sole conference and award of sole optimal student paper at the same time. The periodical version of this paper is published on JournaloftheACM of ACM admiral periodical.
And be dissolved as this one problem, the difficult problem of the Professor Lin Bingkai a few long-term suspense in discovering this job can bring about parameter complexity domain gains revolutionary headway. Include the problem that a few PCP theorem that are thought to need parameter complexity version originally just can solve among them, of the parameter version that arranges market problem and issue of encode of the least space for example cannot approximate sex. And the new raise that this also makes Professor Lin Bingkai want to capture.
Be based on the new technology that the body in the revolutionary job of K-Biclique gives, first parameter that the collaboration such as triumphant professor obtained Linbing to arrange market issue cannot approximate sex proof. It is important that achievement is published in academic computer science conference FOCS2016, one of excellent jobs that publish as this year FOCS are invited to come international of academic computer science is top-ranking periodical SIAMJournalonComputing, acquire take sb on the staff. Once publish, wide get attention. 2019, lin Bingkai teachs the parameter that arranges market issue for this to cannot find a new concise proof approximately, this proof was obtained current and best cannot compare approximately. This one result was published 2019 with alone author thesis European academic computer is important on conference ICALP, and win the optimal paper award of TrackA paper.
Problem of little space encode is belonged to in encode theory very the problem that gets attention. Be based on the result that obtains in K-Biclique problem, the parameter that the collaboration such as Professor Lin Bingkai proved issue of encode of the least space is algorithmic cannot approximate sex. This proof still can popularize the parameter to the problem of the shortest vector on case cannot approximate sex. The problem of the shortest vector on case has the computational difficulty sex that comparative, still be used at design of fair key password even. This proof lays more accurate complexity foundation to be based on the Jiamidi of case. This collaboration achievement already contribute comes JACM, obtain go over a manuscript or draft expert proposal employ.
The PCP that in parameter the mainest task in the research of approximate algorithm explores high accuracy complexity and parameter complexity frame to fall namely is theorematic, the proof parameter that wants development to give a maturity namely is approximate algorithmic and nether tool. Current, the investigator of academic computer domain of world center launchs a challenge to this task, but specific implementation means is widely divergent. And Lin Bingkai teachs what what be engaged in to pass a few combination construction that have Threshold quality to design Gap-Reduction, prove parameter is approximate thereby algorithmic and nether. The partial technology that he returns the proof PCP theorem with will classical plan puts next analytic undertaking to the frame of high accuracy complexity, seek certain breakthrough thereby. Studying parameter is approximate while algorithm is nether, lin Bingkai still will pursue the design of the approximate algorithm below frame of high accuracy complexity against time.
Education posterity is shallow piece in order to give job
In Japan national informatics institute became 3 years of researchers hind, lin Bingkai is taught at official in September 2019 return to one's country, assume office at Nanjing university. He continues to pursue high-grade learning research on one hand, devote into a foundation to teach forefront on the other hand -- the combines maths teaching job that assumes undergraduate students and graduate student.
Facing posterity people if,seek knowledge thirsty double eye, lin Bingkai hopes he can make the work that faddish grass falls on his back, but assorted maths includes content range wide, lack series connection masterstroke, the student that allows academic strength to owe beautiful has kind of abrupt feeling. To Professor Lin Bingkai character, how to accomplish successfully after thorough research " shallow piece " , make test the new ground of force of its learning work.
Professor Lin Bingkai thinks from beginning to end, "The bag that drop a book " to the student character, do not have too much and real significance, won't provide real academic help for them more. Place of famous mathematician W.T.Gowers puts forward praise highly of Professor Lin Bingkai " important is the more general principle that in proving theorem, uses in assorted maths, is not theorematic itself " concept, be willing to explain the sublime words with deep meaning of involved and abstruse with straightaway content more. Below the premise that enclothes fundamental content, professor Lin Bingkai still introduces task of partial forward position appropriately. The main idea tree that included to introduce current plan to regard algorithmic field among them is decomposed (Treedecomposition) . Although this one achievement is wide inside international limits,get attention, but domestic student is relatively new still to its. Professor Lin Bingkai helped students open the window of another learning wholeheartedly. Additional, professor Lin Bingkai still can be based on an individual experience of first-hand scientific research undertakes content innovates. It is for instance when tuitional Ramsey is theorematic, the traditional application about Ramsey theorem often needs the Ramsey theorem that is used to gather. And the Ramsey theorem on gather compares common Ramsey theorem to want abstraction, it is a challenge to the student's savvy. So Professor Lin Bingkai uses his result in ICALP2012 paper to serve as example, let students successfully understand originally the Ramsey theorem application on blueprint algorithm.
The schoolteaching way that Lin Bingkai teachs and content welcome by broad student. One's pupils or disciples not character, fall to become footpath oneself.
Come for years, professor Lin Bingkai holds theory to develop new trend from beginning to end, for the industry development contributes wisdom and force, promoted academic computer science to progress; In the meantime, to develop academic reserve, he is full of absolute sincerity, ceaseless preach awards course of study to dispel doubts, an ice heart is in jade crock.
Contribute: Xiao Lei
Article print is sent at " Chinese new and high science and technology " magazine 2020 the 23rd period
(reprint make clear origin please)
