scientific article; zbMATH DE number 1962822

zbMath1035.68510MaRDI QIDQ4418658

Beate Bollig

Publication date: 11 August 2003

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

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

This page was built for publication: