Using amplification to compute majority with small majority gates

Gupta, Arvind; Mahajan, Sanjeev

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1331592_3

DetailsSummary

Using amplification to compute majority with small majority gates

Gupta, A., & Mahajan, S. (1997). Using amplification to compute majority with small majority gates. Computational Complexity, 6(1), 46-63.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-39C0-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-39C1-B

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Gupta, Arvind¹, Author
Mahajan, Sanjeev², Author

Affiliations:
1Max Planck Society, ou_persistent13
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1997

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517918
Other: Local-ID: C1256428004B93B8-DE6782FFD369D08AC12565D80044B741-GuptaMahajan1997

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Computational Complexity

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 6 (1) Sequence Number: - Start / End Page: 46 - 63 Identifier: -