Monadic logic programs and functional complexity
- 作者Armando B. Matos
- 卷第176卷
- 印刷ISSN0304-3975
- 文件大小1574.93KB
- 发表时间1997
- DOI10.1016/s0304-3975(96)00093-x
- 页码175-204
同作者推荐
Random Strings Make Hard InstancesHarry Buhrman; Pekka Orponen · 1996
Probably approximately optimal satisficing strategiesRussell Greiner; Pekka Orponen · 1996
OnP-subset structuresDavid A. Russo; Pekka Orponen · Theory of Computing Systems · 1987
A classification of complexity core latticesPekka Orponen · 1986
Instance complexityOrponen, Pekka; Ko, Ker-i; Schöning, Uwe; Watanabe, Osamu · Journal of the ACM · 1994
Design methods for 3D wireframe DNA nanostructuresOrponen, Pekka · Natural Computing · 2017
Optimal Approximations and Polynomially Levelable SetsOrponen, Pekka; Russo, David A.; Schöning, Uwe · SIAM Journal on Computing · 1986