Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A space efficient algorithm for the monotone planar circuit value problem

From MaRDI portal
Publication:1133895
Jump to:navigation, search

DOI10.1016/0020-0190(80)90117-9zbMath0422.68011OpenAlexW2009121158MaRDI QIDQ1133895

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 algorithmsparallel processingcombinational circuitmonotone planar circuit value problem


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (3)

On the construction of parallel computers from various basis of Boolean functions ⋮ Complexity theory of parallel time and hardware ⋮ \(\varepsilon\)-productions in context-free grammars



Cites Work

  • Unnamed Item
  • Unnamed Item
  • An observation on time-storage trade off
  • Log Space Recognition and Translation of Parenthesis Languages
  • The Parallel Evaluation of General Arithmetic Expressions
  • A unified approach to models of synchronous parallel machines


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1133895&oldid=29967032"
Category:
  • Pages with script errors
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 March 2024, at 03:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki