scientific article; zbMATH DE number 1834649
From MaRDI portal
Publication:4779145
zbMath0999.68068MaRDI QIDQ4779145
Stephan Waack, Henrik Brosenne, Matthias Homeister
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360212
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs ⋮ Lower bounds for restricted read-once parity branching programs ⋮ A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs ⋮ Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
This page was built for publication:
