Pages that link to "Item:Q991004"

The following pages link to Optimal query complexity bounds for finding graphs (Q991004):

Displaying 3 items.

• Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
• Network verification via routing table queries (Q743125) (← links)
• On triangle estimation using tripartite independent set queries (Q825973) (← links)