Martin Sauerhoff

From MaRDI portal
Person:234347

Available identifiers

zbMath Open sauerhoff.martinMaRDI QIDQ234347

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q30816272011-03-09Paper
An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order2010-10-11Paper
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions2010-08-16Paper
Applying approximate counting for computing the frequency moments of long data streams2009-08-06Paper
Quantum branching programs and space-bounded nonuniform quantum complexity2005-06-01Paper
On multi-partition communication complexity2004-11-12Paper
https://portal.mardi4nfdi.de/entity/Q47395992004-08-06Paper
The power of nondeterminism and randomness for oblivious branching programs2003-08-26Paper
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44186592003-08-11Paper
Approximation of boolean functions by combinatorial rectangles2003-07-30Paper
On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs2003-01-14Paper
On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions2002-08-14Paper
Optimal ordered binary decision diagrams for read-once formulas2002-04-21Paper
https://portal.mardi4nfdi.de/entity/Q27625062002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q45015292001-04-26Paper
https://portal.mardi4nfdi.de/entity/Q45016812001-04-09Paper
An improved hierarchy result for partitioned BDDs2000-12-07Paper
https://portal.mardi4nfdi.de/entity/Q42510421999-10-06Paper
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models1999-09-22Paper
Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q48858951996-11-04Paper

Research outcomes over time

This page was built for person: Martin Sauerhoff