scientific article; zbMATH DE number 6789278
From MaRDI portal
Publication:5368747
DOI10.4230/LIPIcs.CCC.2016.13zbMath1380.68223MaRDI QIDQ5368747
Avi Wigderson, Parikshit Gopalan, Rocco A. Servedio
Publication date: 10 October 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (11)
An Optimal Separation of Randomized and Quantum Query Complexity ⋮ Low-Sensitivity Functions from Unambiguous Certificates. ⋮ Alternation, sparsity and sensitivity: bounds and exponential gaps ⋮ Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling ⋮ Unnamed Item ⋮ A tighter relation between sensitivity complexity and certificate complexity ⋮ Sensitivity, affine transforms and quantum communication complexity ⋮ Unnamed Item ⋮ New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity ⋮ Fourier bounds and pseudorandom generators for product tests ⋮ Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
This page was built for publication:
