Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random-access machines

Dietzfelbinger, Martin; Kutyłowski, Mirosław; Reischuk, Rüdiger

Przejdź do menu głównego Przejdź do wyszukiwarki Przejdź do zawartości

polski
English

Home page
Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random-access machines

Description

Title: Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random-access machines
Journal title: SIAM Journal on Computing
Creator: Dietzfelbinger, Martin ; Kutyłowski, Mirosław ; Reischuk, Rüdiger
Pages: s. 1196-1230
Description: Abstr.
Language of abstract: eng
Date issued: 1996
Type: Tekst
Language: eng
Detailed object type: art
Object type: Artykuł
Location: Vol. 25, nr 6 (1996)

The build of the Digital Demonstration Library was commissioned by the Name of the Institution of the Foundation's Institution. The Name of the Foundation under the Program, the Library Project and its creation under the patronage of the Name of the Institution.

Europejski Fundusz Rozwoju Regionalnego Unii Europejskiej

The project titled "Workflow to develop digital publications at the university" co-financed by the European Union from the European Regional Development Fund.

We use files, through the cookie quality improvement layer of our website.For more information, please read the document Privacy Policy