Pages that link to "Item:Q3985804"
From MaRDI portal
The following pages link to CREW PRAM<scp>s</scp> and Decision Trees (Q3985804):
Displaying 8 items.
- A NOTE ON THE POLYNOMIAL REPRESENTATION OF BOOLEAN FUNCTIONS OVER GF(2) (Q5249026) (← links)
- Separation Between Deterministic and Randomized Query Complexity (Q5376437) (← links)
- Quantum lower bounds by quantum arguments (Q5894821) (← links)
- A tighter relation between sensitivity complexity and certificate complexity (Q5915958) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
- On the elusiveness of Hamiltonian property (Q5931908) (← links)
- On the (im)possibility of time-lock puzzles in the quantum random oracle model (Q6604881) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)