scientific article; zbMATH DE number 1929932

MaRDI QIDQ4708564zbMATH OpenFDO

Authors 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

Mathematics Subject Classification ID

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

Recommendations

• A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
• scientific article; zbMATH DE number 1759409
• Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
• scientific article; zbMATH DE number 1962822
• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs

Cited in

(7)

• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 1962822 (Why is no real title available?)
• Lower bounds for nondeterministic semantic read-once branching programs
• Lower bounds for restricted read-once parity branching programs
• A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
• A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708564)