Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Quantum Distributed Complexity of Set Disjointness on a Line: Label: en
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error: Label: en
Approximate Degree, Weight, and Indistinguishability: Label: en
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems: Label: en
Erasure-Resilient Sublinear-Time Graph Algorithms: Label: en
Complexity of Shift Bribery in Committee Elections: Label: en
Counting Homomorphisms to Trees Modulo a Prime: Label: en
Multiplicative Parameterization Above a Guarantee: Label: en
Can a Skywalker Localize the Midpoint of a Rope?: Label: en
On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits: Label: en
A Polynomial Time Algorithm for 3SAT: Label: en
Fractal Intersections and Products via Algorithmic Dimension: Label: en
The Subgraph Testing Model: Label: en
A ZPP ^NP[1] Lifting Theorem: Label: en
Inner Product and Set Disjointness: Label: en
Decoding Variants of Reed-Muller Codes over Finite Grids: Label: en
On the Power of Amortization in Secret Sharing: Label: en
Strongly Exponential Separation between Monotone VP and Monotone VNP: Label: en
On Existential MSO and Its Relation to ETH: Label: en
Popular Matching in Roommates Setting Is NP-hard: Label: en
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials: Label: en
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems: Label: en
New Resolution-Based QBF Calculi and Their Proof Complexity: Label: en
PPSZ for k ≥ 5: More Is Better: Label: en
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism: Label: en
Approximating Pairwise Correlations in the Ising Model: Label: en
Representations of Monotone Boolean Functions by Linear Programs: Label: en
Bounded Independence versus Symmetric Tests: Label: en
On Minrank and Forbidden Subgraphs: Label: en
Constant-Error Pseudorandomness Proofs from Hardness Require Majority: Label: en
Split Contraction: Label: en
Strong Locally Testable Codes with Relaxed Local Decoders: Label: en
Corrigendum to Affine Relativization: Label: en
On the Entropy Loss and Gap of Condensers: Label: en
Monotone Properties of k -Uniform Hypergraphs Are Weakly Evasive: Label: en
Tight Lower Bounds for the Complexity of Multicoloring: Label: en
Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization: Label: en
Read-Once Branching Programs for Tree Evaluation Problems: Label: en
The Complexity of Boolean Surjective General-Valued CSPs: Label: en
Surjective H-Colouring over Reflexive Digraphs: Label: en
Reconstruction of Full Rank Algebraic Branching Programs: Label: en
A Universal Tree Balancing Theorem: Label: en
Streaming Communication Protocols: Label: en
Simultaneous Feedback Vertex Set: Label: en
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems: Label: en
Property Testing of Joint Distributions using Conditional Samples: Label: en
Circuits and Expressions over Finite Semirings: Label: en
Communication Complexity and Graph Families: Label: en
Lower bounds for Sum and Sum of Products of Read-once Formulas: Label: en
Multi-Party Protocols, Information Complexity and Privacy: Label: en