A space efficient algorithm for the monotone planar circuit value problem

DOI10.1016/0020-0190(80)90117-9MaRDI QIDQ1133895zbMATH OpenOpenAlexFDO

Authors Leslie M. Goldschlager

Publication date 1980

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(80)90117-9

zbMATH Keywords

analysis of algorithmscombinational circuitmonotone planar circuit value problemparallel processing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A unified approach to models of synchronous parallel machines
• An observation on time-storage trade off
• scientific article; zbMATH DE number 3555903 (Why is no real title available?)
• scientific article; zbMATH DE number 3428547 (Why is no real title available?)
• Log Space Recognition and Translation of Parenthesis Languages
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(4)

• On the construction of parallel computers from various basis of Boolean functions
• Complexity theory of parallel time and hardware
• -productions in context-free grammars
• Evaluating monotone circuits on surfaces

This page was built for publication: A space efficient algorithm for the monotone planar circuit value problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133895)