Toggle Main Menu Toggle Search

Open Access padlockePrints

On the complexity of hazard-free circuits

Lookup NU author(s): Dr Andrey Mokhov



This is the authors' accepted manuscript of a conference proceedings (inc. abstract) that has been published in its final definitive form by ACM, 2018.

For re-use rights please refer to the publisher's terms and conditions.

Publication metadata

Author(s): Ikenmeyer C, Komarath B, Lenzen C, Lysikov V, Mokhov A, Sreenivasaiah K

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: ACM Symposium on Theory of Computing

Year of Conference: 2018

Pages: 878-889

Online publication date: 20/06/2018

Acceptance date: 09/02/2018

Date deposited: 09/02/2018

Publisher: ACM


DOI: 10.1145/3188745.3188912

Library holdings: Search Newcastle University Library for this item

ISBN: 9781450355599