Pages that link to "Item:Q5363756"

The following pages link to Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) (Q5363756):

Displaying 41 items.

• Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
• Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
• Structural parameterizations of clique coloring (Q832512) (← links)
• Proofs of Work from worst-case assumptions (Q1673424) (← links)
• Two-dimensional pattern matching against local and regular-like picture languages (Q2029490) (← links)
• Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
• A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
• The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
• Lengths of words accepted by nondeterministic finite automata (Q2203588) (← links)
• Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
• Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
• A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
• Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility (Q2800573) (← links)
• On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
• Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) (Q4571928) (← links)
• What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
• Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
• Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
• Simple doubly-efficient interactive proof systems for locally-characterizable sets (Q4993281) (← links)
• Fine-grained derandomization: from problem-centric to resource-centric complexity (Q5002697) (← links)
• Multivariate analysis of orthogonal range searching and graph distances (Q5009466) (← links)
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
• On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
• Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
• (Q5089217) (← links)
• (Q5090378) (← links)
• Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
• Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
• Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
• (Q5092465) (← links)
• Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
• Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
• (Q5111874) (← links)
• On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
• Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
• Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380) (← links)
• (Q5867524) (← links)
• Sublinear-time reductions for big data computing (Q5918726) (← links)
• A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs (Q6075716) (← links)
• Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)