scientific article
From MaRDI portal
Publication:2762533
zbMath0976.68510MaRDI QIDQ2762533
Publication date: 9 January 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2010/20100563
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (7)
Lower bounds on the OBDD size of two fundamental functions' graphs ⋮ Approximating Boolean functions by OBDDs ⋮ Universal Hashing via Integer Arithmetic Without Primes, Revisited ⋮ BDDs -- design, analysis, complexity, and applications. ⋮ Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication ⋮ Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication ⋮ Bounds on the OBDD-size of integer multiplication via universal hashing
This page was built for publication:
