Pages that link to "Item:Q5957726"

The following pages link to On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions (Q5957726):

Displaying 8 items.

• Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection (Q503599) (← links)
• On probabilistic pushdown automata (Q989292) (← links)
• Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
• Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
• The power of nondeterminism and randomness for oblivious branching programs (Q1405793) (← links)
• Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
• On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
• On BPP versus \(NP\cup coNP\) for ordered read-once branching programs (Q5941564) (← links)