M. Karp, Complexity of Computer Computations , pp. 85-103, 1972, PlenumR.M. Karp. Complexity of computer computations. In R.E. Miller and J.W. Thatcher, editors, Reducibility Among Combinatorial Problems, pages
Concepts from computational complexity theory can be directly applied to the computations that brains must accomplish. For example, one well-known combinatorial optimization problem, the traveling salesman problem, has proven relevant to the analysis of spatial cognition and the diagnoses of cognitive ...
[The complexity of theorem proving procedures, in "Proceedings, Third Annual Assoc. Comput. Mach. Symposium on Theory of Computing", pp. 151–158, Assoc. Comput. Mach., New York 1971] and Karp [Reducibility among combinational problems, in "Complexity of Computer Computations" (R. E. Miller...
Karp, R. (1972). Reducibility among combinatorial problems. In R. Miller & J. Thatcher (Eds.),Complexity of Computer Computations(pp. 85–103). Plenum Press. ChapterGoogle Scholar Manurangsi, P., & Raghavendra, P. (2017). A birthday repetition theorem and complexity of approximating dense ...
Computer Networks Journal 2020,Computer Networks AzzedineBoukerche, ...PengSun 7.2.1How to reduce the model complexity Typically, the model complexity generally can be judged from two aspects, i.e., the structure complexity andcomputation complexity. Ordinarily, with the increase of model structure ...
Research on electronic devices and materials is currently driven by both the slowing down of transistor scaling and the exponential growth of computing needs, which make present digital computing increasingly capacity-limited and power-limited. A promisi
12. The algorithm described in this paper has low complexity and is validated by computer simulation. 该算法保留了LS算法运算量小和实现简单的优点,大大降低了噪声对信道估计精度的影响,仿真结果验证了算法的有效性。 13. The importance and complexity of distant hybridization were discussed and a method ...
Complexity of Computer Computations, vol. 43 (1972), pp. 85-103 CrossrefView in ScopusGoogle Scholar [27] W. Kern, D. Paulusma The computational complexity of the elimination problem in generalized sports competitions Discrete Optim., 1 (2004), pp. 201-214 Google Scholar [28] K. Konczak,...
Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), Plenum, New York (1972), pp. 85-103 CrossrefView in ScopusGoogle Scholar [18] M. Karpiński, A. Ruciński, E. Szymańska Computational complexity of the perfect matching...
Department of Networked Intelligence, Pengcheng Laboratory, Shenzhen, P.R. China Yonghong Tian School of Electronic and Computer Engineering, Shenzhen Graduate School, Peking University, Beijing, P.R. China Yonghong Tian School of Artificial Intelligence, University of Chinese Academy of Sciences, Beijing...