Pages that link to "Item:Q2843225"
From MaRDI portal
The following pages link to Automata, Languages, and Programming (Q2843225):
Displaying 50 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- Asymmetric coloring games on incomparability graphs (Q324375) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- Approximation algorithms for the joint replenishment problem with deadlines (Q906550) (← links)
- Comparator circuits over finite bounded posets (Q1640992) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
- On reducing linearizability to state reachability (Q1641012) (← links)
- Selling two goods optimally (Q1641015) (← links)
- Interactive communication with unknown noise rate (Q1641020) (← links)
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- Finding a path with two labels forbidden in group-labeled graphs (Q2173429) (← links)
- An algebraic geometric approach to Nivat's conjecture (Q2304526) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- A combinatorial polynomial algorithm for the linear Arrow-Debreu market (Q2347801) (← links)
- Rational subsets and submonoids of wreath products. (Q2347806) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- The inverse Shapley value problem (Q2411521) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- On temporal graph exploration (Q2662667) (← links)
- No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373) (← links)
- A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry (Q2808162) (← links)
- Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method (Q2843226) (← links)
- The NOF Multiparty Communication Complexity of Composed Functions (Q2843227) (← links)
- Quantum Strategies Are Better Than Classical in Almost Any XOR Game (Q2843231) (← links)
- Efficient Submodular Function Maximization under Linear Packing Constraints (Q2843232) (← links)
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups (Q2843234) (← links)
- Secretary Problems with Convex Costs (Q2843237) (← links)
- Nearly Simultaneously Resettable Black-Box Zero Knowledge (Q2843238) (← links)
- Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity (Q2843239) (← links)
- On Quadratic Programming with a Ratio Objective (Q2843240) (← links)
- De-amortizing Binary Search Trees (Q2843241) (← links)
- Efficient Sampling Methods for Discrete Distributions (Q2843242) (← links)
- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (Q2843243) (← links)
- Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location (Q2843244) (← links)
- Testing Coverage Functions (Q2843245) (← links)
- Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree (Q2843246) (← links)
- A Dependent LP-Rounding Approach for the k-Median Problem (Q2843247) (← links)
- Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs (Q2843249) (← links)
- Computing the Visibility Polygon of an Island in a Polygonal Domain (Q2843250) (← links)
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q2843251) (← links)
- Max-Cut Parameterized above the Edwards-Erdős Bound (Q2843252) (← links)
