DTML IS LOGSPACE HARD UNDER NC1 REDUCTIONS

IF 0.5 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Parallel Processing Letters Pub Date : 1992-09-01 DOI:10.1142/S0129626492000313

R. Sarnath

引用次数: 0

Abstract

The Different Than Majority Labeling (DTML) problem has a simple polynomial time algorithm, but is not known to be in NC. In this paper, we show that the DTML problem is extremely unlikely to have an NC1 algorithm.

查看原文本刊更多论文

在nc1缩减下，DTML在日志空间上是困难的

不同多数标记(DTML)问题有一个简单的多项式时间算法，但在NC中还不知道。在本文中，我们证明了DTML问题极不可能有NC1算法。

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

求助全文

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

来源期刊

Parallel Processing Letters COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-

CiteScore

0.90

自引率

25.00%

发文量

期刊介绍： Parallel Processing Letters (PPL) aims to rapidly disseminate results on a worldwide basis in the field of parallel processing in the form of short papers. It fills the need for an information vehicle which can convey recent achievements and further the exchange of scientific information in the field. This journal has a wide scope and topics covered included: - design and analysis of parallel and distributed algorithms - theory of parallel computation - parallel programming languages - parallel programming environments - parallel architectures and VLSI circuits