Pages that link to "Item:Q2843225"
From MaRDI portal
The following pages link to Automata, Languages, and Programming (Q2843225):
Displaying 50 items.
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner (Q2843256) (← links)
- Space-Constrained Interval Selection (Q2843257) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q2843258) (← links)
- Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (Q2843259) (← links)
- Universal Factor Graphs (Q2843260) (← links)
- Parameterized Approximation via Fidelity Preserving Transformations (Q2843261) (← links)
- Backdoors to Acyclic SAT (Q2843262) (← links)
- Dominators, Directed Bipolar Orders, and Independent Spanning Trees (Q2843263) (← links)
- Hardness of Approximation for Quantum Problems (Q2843264) (← links)
- The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (Q2843265) (← links)
- Stochastic Vehicle Routing with Recourse (Q2843266) (← links)
- The Online Metric Matching Problem for Doubling Metrics (Q2843268) (← links)
- Approximating Sparse Covering Integer Programs Online (Q2843269) (← links)
- Streaming and Communication Complexity of Clique Approximation (Q2843271) (← links)
- Distributed Private Heavy Hitters (Q2843272) (← links)
- A Thirty Year Old Conjecture about Promise Problems (Q2843273) (← links)
- Minimum Latency Submodular Cover (Q2843274) (← links)
- Constant-Time Algorithms for Sparsity Matroids (Q2843275) (← links)
- CRAM: Compressed Random Access Memory (Q2843276) (← links)
- Faster Fully Compressed Pattern Matching by Recompression (Q2843278) (← links)
- NNS Lower Bounds via Metric Expansion for l ∞ and EMD (Q2843279) (← links)
- Quantum Adversary (Upper) Bound (Q2843280) (← links)
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281) (← links)
- Preserving Terminal Distances Using Minors (Q2843284) (← links)
- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (Q2843285) (← links)
- Classical and Quantum Partition Bound and Detector Inefficiency (Q2843287) (← links)
- Testing Similar Means (Q2843288) (← links)
- The Parameterized Complexity of k-Edge Induced Subgraphs (Q2843289) (← links)
- Converting Online Algorithms to Local Computation Algorithms (Q2843290) (← links)
- Assigning Sporadic Tasks to Unrelated Parallel Machines (Q2843291) (← links)
- A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals (Q2843292) (← links)
- Geometry of Online Packing Linear Programs (Q2843293) (← links)
- Self-assembly with Geometric Tiles (Q2843295) (← links)
- Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation (Q2843296) (← links)
- Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (Q2843297) (← links)
- Parameterized Tractability of Multiway Cut with Parity Constraints (Q2843298) (← links)
- Set Cover Revisited: Hypergraph Cover with Hard Capacities (Q2843299) (← links)
- On the Limits of Sparsification (Q2843300) (← links)
- Certifying 3-Connectivity in Linear Time (Q2843301) (← links)
- Epsilon-Net Method for Optimizations over Separable States (Q2843302) (← links)
- Faster Algorithms for Privately Releasing Marginals (Q2843303) (← links)
- Stochastic Matching with Commitment (Q2843305) (← links)
- Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance (Q2843306) (← links)
- A Matrix Hyperbolic Cosine Algorithm and Applications (Q2843307) (← links)
- Locally Stable Marriage with Strict Preferences (Q2968513) (← links)
- On Multiple Keyword Sponsored Search Auctions with Budgets (Q3166992) (← links)
- A Theory Independent Curry-De Bruijn-Howard Correspondence (Q3166993) (← links)
- Standing on the Shoulders of a Giant (Q3166994) (← links)
- Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations (Q3166995) (← links)
- Randomized Mechanisms for Multi-unit Auctions (Q3166996) (← links)
