M. Karp, Complexity of Computer Computations , pp. 85-103, 1972, PlenumR. E. Miller and J. W. Thatcher, editors. Complexity of Computer Computations. Plenum Press., New York, 1972.Karp, R.M., 1972. Complexity of Computer Computations. In [http://www.cs.berkeley.edu/~luca/cs172/...
Complexity of Computer Computationsby Raymond E. Miller; James W. Thatcher Mathematical Physics and Mathematics RBJR Rice - 《Mathematics of Computation》 被引量: 0发表: 1974年 B74-1 Complexity of Computer Computations Mathematical Physics and Mathematics Rice,R J. - 《Computers IEEE Transactions ...
Complexity of parallel matrix computations We estimate parallel complexity of several matrix computations under both Boolean and arithmetic machine models using deterministic and probabilistic appro... V Pan - 《Theoretical Computer Science》 被引量: 157发表: 1987年 The complexity of massive data set co...
Complexity of Computer Computations, pp. 85–103. Plenum Press (1972) Google Scholar Karpinski, M., Schudy, W.: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, ...
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 (1972), pp. 83-103 Google Scholar [12] M. Karpiński, A. Ruciński, E. Szymańska Computational complexity of the perfect matching problem in hypergraphs with subcritical density Int. J. Found. Comput. Sci., 21 (6) (2010), pp. 905-992 View in ScopusGo...
Aims and scope computational complexity presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format. The central topics are: Models of computation, complexity...
Complexity of Computer Computations, Springer (1972), pp. 85-103 CrossrefView in ScopusGoogle Scholar [30] J. King, A survey of 3SUM-hard problems, 2004. Google Scholar [31] V. Latora, M. Marchiori A measure of centrality based on network efficiency New Journal of Physics (2007) Google...
The reductions used are characterized by their nontrivial use of arithmetic. 关键词: computational complexity matrix algebra/ complexity permanent function matrices counting problems nondeterministic polynomial time computations arithmetic/ C4140 Linear algebra (numerical analysis) C4290 Other computer theory ...
This is an expository survey of recent results in computer science related to the computation of fixed points, with the central one being that the problem of finding an approximate Nash equilibrium of a bimatrix game is PPAD-complete. This means that this problem is, in a certain sense, as...