Titlebook: Computer Science - Theory and Applications; Third International Edward A. Hirsch,Alexander A. Razborov,Anatol Slis Conference proceedings

DEBUT

書目名稱Computer Science - Theory and Applications影響因子(影響力)




書目名稱Computer Science - Theory and Applications影響因子(影響力)學(xué)科排名




書目名稱Computer Science - Theory and Applications網(wǎng)絡(luò)公開度




書目名稱Computer Science - Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computer Science - Theory and Applications被引頻次




書目名稱Computer Science - Theory and Applications被引頻次學(xué)科排名




書目名稱Computer Science - Theory and Applications年度引用




書目名稱Computer Science - Theory and Applications年度引用學(xué)科排名




書目名稱Computer Science - Theory and Applications讀者反饋




書目名稱Computer Science - Theory and Applications讀者反饋學(xué)科排名

GLUT

變形詞

無聊點好

Twelve Problems in Proof Complexitymputational complexity, the goals are different. In proof complexity we are studying the question . There are various ways how one can measure the . of a theorem. We may ask what is . of the theorem in a given formal system. Thus the complexity is the size of proofs. This corresponds to questions in

LEER

1分開

Simple Stochastic Games, Mean Payoff Games, Parity Gameson finite graphs. The best known algorithms for the solution of these games run in subexponential time and it is a major open problem whether they can be solved in polynomial time. In the talk, I plan to define these games, describe what is known about them and present many intriguing open problems.

1分開

covert

A Logspace Algorithm for Partial 2-Tree Canonizationsteps: (a) We exploit the “tree of cycles” property of biconnected partial 2-trees to canonize them in logspace. (b) We analyze Lindell’s tree canonization algorithm and show that canonizing general partial 2-trees is also in logspace, using the algorithm to canonize biconnected partial 2-trees.

故意

debacle