scientific article; zbMATH DE number 1361505
From MaRDI portal
Publication:4699324
Recommendations
- On the hierarchy of nondeterministic branching k-programs
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
- scientific article; zbMATH DE number 1775455
- A superpolynomial lower bound for \((1,+k(n))\)-branching programs
- New lower bounds and hierarchy results for restricted branching programs
- New lower bounds and hierarchy results for restricted branching programs
- A separation of syntactic and nonsyntactic (1,+k)-branching programs
- A hierarchy result for read-once branching programs with restricted parity nondeterminism
- scientific article; zbMATH DE number 706832
Cited in
(14)- A lower bound on branching programs reading some bits twice
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
- New lower bounds and hierarchy results for restricted branching programs
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
- A hierarchy result for read-once branching programs with restricted parity nondeterminism
- scientific article; zbMATH DE number 3890736 (Why is no real title available?)
- Incremental Branching Programs
- Extension of the hierarchy for k-OBDDs of small width
- scientific article; zbMATH DE number 4007722 (Why is no real title available?)
- On the complexity of branching programs and decision trees for clique functions
- scientific article; zbMATH DE number 1759451 (Why is no real title available?)
- scientific article; zbMATH DE number 2086405 (Why is no real title available?)
- A separation of syntactic and nonsyntactic (1,+k)-branching programs
- Incremental 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 Q4699324)
