scientific article; zbMATH DE number 1929932

zbMath1014.68504MaRDI QIDQ4708564

Beate Bollig, Philipp Woelfel

Publication date: 18 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200131.htm

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

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: