scientific article

From MaRDI portal

Revision as of 13:58, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3993546

Jump to:navigation, search

zbMath0697.68011MaRDI QIDQ3993546

Ingo Wegener

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity Boolean functions circuits algorithms for elementary functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (3)

Secure collaborative supply chain planning and inverse optimization -- the JELS model ⋮ On the number of iterations required by Von Neumann addition ⋮ The Decomposition Tree for analyses of Boolean functions

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3993546&oldid=13484471"