Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMATH Open0674.68032MaRDI QIDQ3829071

Juraj Hromkovič

Publication date: 1990



Title of this publication is not available (Why is that?)


zbMATH Keywords

lower boundscircuitsBoolean functionVLSI algorithmscombinational complexity


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity of computation (including implicit computational complexity) (03D15) Algorithms in computer science (68W99)



Related Items (1)

Nonlinear lower bounds on the number of processors of circuits with sublinear separators






This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3829071&oldid=17420380"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 17:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki