Pages that link to "Item:Q1816743"

The following pages link to New lower bounds and hierarchy results for restricted branching programs (Q1816743):

Displaying 9 items.

• A characterization and nearly linear-time equivalence test for \(\mu\)-branching programs (Q679436) (← links)
• Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
• A lower bound on branching programs reading some bits twice (Q1392030) (← links)
• On uncertainty versus size in branching programs. (Q1401198) (← links)
• A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
• Superlinear lower bounds for bounded-width branching programs (Q1894446) (← links)
• Expanders and time-restricted branching programs (Q2378527) (← links)
• A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
• (Q4699324) (← links)