Experimental and Efficient Algorithms

DOI10.1007/b136461zbMath1121.90339OpenAlexW2485841483MaRDI QIDQ5710026

Daniel Sawitzki

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136461

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Data structures (68P05)

Related Items (2)

On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem ⋮ On the size of (generalized) OBDDs for threshold functions

This page was built for publication: Experimental and Efficient Algorithms