Lifting independence results in bounded arithmetic
暂无分享,去创建一个
[1] S. Buss. Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic ∗ , 1990 .
[2] Jan Krajícek,et al. Witnessing Functions in Bounded Arithmetic and Search Problems , 1998, J. Symb. Log..
[3] S. Buss,et al. An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic , 1994 .
[4] J. Krajícek. Fragments of bounded arithmetic and bounded query classes , 1993 .
[5] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[6] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[7] 外史 竹内. Bounded Arithmetic と計算量の根本問題 , 1996 .
[8] Jan Krajícek,et al. Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.
[9] Béla Bollobás,et al. Random Graphs , 1985 .
[10] P. Erdös. Some remarks on the theory of graphs , 1947 .
[11] Jan Krajícek,et al. Bounded Arithmetic and the Polynomial Hierarchy , 1991, Ann. Pure Appl. Log..
[12] Pavel Pudlák,et al. Ramsey's Theorem in Bounded Arithmetic , 1990, CSL.
[13] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.