Pages that link to "Item:Q1587348"
From MaRDI portal
The following pages link to On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs (Q1587348):
Displayed 11 items.
- Yet harder knapsack problems (Q653327) (← links)
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- On the P versus NP intersected with co-NP question in communication complexity (Q1044738) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). (Q1811103) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- On BPP versus \(NP\cup coNP\) for ordered read-once branching programs (Q5941564) (← links)
- On (simple) decision tree rank (Q6050134) (← links)