On the Coincidence of Complexity Classes BPC and TC $${}^{0}$$

Moscow University Computational Mathematics and Cybernetics Pub Date : 2023-02-07 DOI:10.3103/s0278641922040069

I. V. Savitskii

引用次数: 0

Abstract

It is shown that the class of dictionary functions defined on the basis of bounded prefix concatenation coincides with the familiar complexity class $\textrm{TC}^{0}$.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

论复杂性类BPC和TC的重合性 $${}^{0}$$

摘要本文证明了基于有界前缀连接的字典函数类与我们熟悉的复杂度类$\textrm{TC}^{0}$是一致的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Moscow University Computational Mathematics and Cybernetics

自引率

0.00%

发文量

期刊最新文献

On Maxima of Stationary Delay in the $${M/G/2}$$ Systems Nonsingular Solutions of the Matrix Equation $$\boldsymbol{XAX=AXA}$$ and the Centralizer of the Matrix $$\boldsymbol{A}$$ On the Cardinality Computation Problem for Regular Languages over Symmetric Groups Constructing Reachable Sets for a Class of Nonsmooth Control Systems on a Plane Reconstructing Unknown Coefficients of Stochastic Differential Equations and Intelligently Predicting Random Processes with Directed Learning