Pages that link to "Item:Q1289238"
From MaRDI portal
The following pages link to Randomized complexity lower bound for arrangements and polyhedra (Q1289238):
Displaying 5 items.
- Complexity lower bounds for randomized computation trees over zero characteristic fields (Q1587344) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
- ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS (Q3526528) (← links)
- (Q5088995) (← links)