Pages that link to "Item:Q1426008"

The following pages link to Some connections between bounded query classes and non-uniform complexity. (Q1426008):

Displaying 17 items.

• Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
• Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
• The 1-versus-2 queries problem revisited (Q970102) (← links)
• When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
• On the hardness of computing the permanent of random matrices (Q1355377) (← links)
• Time bounded frequency computations (Q1383147) (← links)
• Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
• Some structural properties of SAT (Q1587336) (← links)
• Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
• The value of help bits in randomized and average-case complexity (Q2012180) (← links)
• One query reducibilities between partial information classes (Q2575741) (← links)
• A proof of Beigel's cardinality conjecture (Q4032650) (← links)
• Bounded queries to arbitrary sets (Q4717045) (← links)
• On computing Boolean connectives of characteristic functions (Q4835862) (← links)
• (Q4852904) (← links)
• Reductions to sets of low information content (Q5204315) (← links)
• A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273) (← links)