Random lattices and a conjectured 0 - 1 law about their polynomial time computable properties
暂无分享,去创建一个
[1] K. Compton. Laws in Logic and Combinatorics , 1989 .
[2] Ronald Fagin,et al. Probabilities on finite models , 1976, Journal of Symbolic Logic.
[3] H. Fédérer. Geometric Measure Theory , 1969 .
[4] Jack H. Lutz,et al. Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small , 1996, Theor. Comput. Sci..
[5] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[6] Miklós Ajtai,et al. Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[7] Miklós Ajtai,et al. The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[8] Cynthia Dwork,et al. A public-key cryptosystem with worst-case/average-case equivalence , 1997, STOC '97.
[9] Phokion G. Kolaitis,et al. 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey , 2000, MFCS.