Pages that link to "Item:Q2843225"
From MaRDI portal
The following pages link to Automata, Languages, and Programming (Q2843225):
Displaying 50 items.
- Short PCPs with Projection Queries (Q5167739) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Coordination Mechanisms for Selfish Routing over Time on a Tree (Q5167741) (← links)
- On Area-Optimal Planar Graph Drawings (Q5167742) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5167743) (← links)
- Listing Triangles (Q5167744) (← links)
- On DNF Approximators for Monotone Boolean Functions (Q5167745) (← links)
- Internal DLA: Efficient Simulation of a Physical Growth Model (Q5167746) (← links)
- Lower Bounds for Approximate LDCs (Q5167747) (← links)
- Testing Probability Distributions Underlying Aggregated Data (Q5167749) (← links)
- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost (Q5167750) (← links)
- The Bose-Hubbard Model is QMA-complete (Q5167751) (← links)
- Characterization of Binary Constraint System Games (Q5167752) (← links)
- Fast Algorithms for Constructing Maximum Entropy Summary Trees (Q5167753) (← links)
- Thorp Shuffling, Butterflies, and Non-Markovian Couplings (Q5167754) (← links)
- Dynamic Complexity of Directed Reachability and Other Problems (Q5167755) (← links)
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile (Q5167756) (← links)
- Canadians Should Travel Randomly (Q5167757) (← links)
- Efficiency Guarantees in Auctions with Budgets (Q5167758) (← links)
- Parameterized Complexity of Bandwidth on Trees (Q5167759) (← links)
- Testing Equivalence of Polynomials under Shifts (Q5167761) (← links)
- Optimal Analysis of Best Fit Bin Packing (Q5167762) (← links)
- Light Spanners (Q5167763) (← links)
- Semi-Streaming Set Cover (Q5167764) (← links)
- Online Stochastic Reordering Buffer Scheduling (Q5167765) (← links)
- Demand Queries with Preprocessing (Q5167766) (← links)
- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (Q5167767) (← links)
- Public vs Private Coin in Bounded-Round Information (Q5167768) (← links)
- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations (Q5167769) (← links)
- Improved Submatrix Maximum Queries in Monge Matrices (Q5167770) (← links)
- Families with Infants: A General Approach to Solve Hard Partition Problems (Q5167772) (← links)
- Changing Bases: Multistage Optimization for Matroids and Matchings (Q5167773) (← links)
- Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (Q5167774) (← links)
- Nearly Linear-Time Model-Based Compressive Sensing (Q5167775) (← links)
- Breaking the PPSZ Barrier for Unique 3-SAT (Q5167776) (← links)
- Privately Solving Linear Programs (Q5167777) (← links)
- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions (Q5167778) (← links)
- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not (Q5167779) (← links)
- Partial Garbling Schemes and Their Applications (Q5167780) (← links)
- On the Complexity of Trial and Error for Constraint Satisfaction Problems (Q5167781) (← links)
- Information Theoretical Cryptogenography (Q5167782) (← links)
- The Complexity of Somewhat Approximation Resistant Predicates (Q5167783) (← links)
- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (Q5167784) (← links)
- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields (Q5167786) (← links)
- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits (Q5167788) (← links)
- Testing Forest-Isomorphism in the Adjacency List Model (Q5167790) (← links)
- Parameterized Approximation Schemes Using Graph Widths (Q5167791) (← links)
- FPTAS for Weighted Fibonacci Gates and Its Applications (Q5167792) (← links)
- Parameterized Algorithms to Preserve Connectivity (Q5167793) (← links)
- Nonuniform Graph Partitioning with Unrelated Weights (Q5167794) (← links)