Marked PCP is decidable
- 作者Vesa Halava; Mika Hirvensalo; Ronald de Wolf
- 卷第255卷
- 印刷ISSN0304-3975
- 文件大小147.36KB
- 发表时间2001
- DOI10.1016/s0304-3975(99)00163-2
- 页码193-204
The rectangle complexity of functions on two-dimensional latticesJ.W. Sander; R. Tijdeman · 2002
Complex-temperature partition function zeros of the Potts model on the honeycomb and kagomé latticesFeldmann, Heiko; Shrock, Robert; Tsai, Shan-Ho · Physical Review E · 1998
Partition Function Zeros of the Ising Model on a Kagomé Lattice in the Complex Magnetic-Field PlaneKim, Seung-Yeon; Kwak, Wooseop · Journal of the Korean Physical Society · 2018
A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer latticeZADOROZHNYUK, O. A. · Discrete Mathematics and Applications · 1997
Partition function zeros of the antiferromagnetic Ising model on triangular lattice in the complex temperature plane for nonzero magnetic fieldSeung-Yeon Kim; Chi-Ok Hwang; Jin Min Kim · 2008
[IEEE Comput. Soc 43rd Annual IEEE Symposium on Foundations of Computer Science - Vancouver, BC, Canada (16-19 Nov. 2002)] The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. - Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptionsMicciancio, D. · 2002