Pages that link to "Item:Q2907481"
From MaRDI portal
The following pages link to Computer Science – Theory and Applications (Q2907481):
Displayed 50 items.
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- Multi-weighted automata and MSO logic (Q504993) (← links)
- Consistency of multidimensional combinatorial substitutions (Q714822) (← links)
- Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences (Q987377) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Prediction of infinite words with automata (Q1635815) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- A Brooks-type result for sparse critical graphs (Q1786052) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Join-reachability problems in directed graphs (Q2254502) (← links)
- The complexity of solving reachability games using value and strategy iteration (Q2254503) (← links)
- Towards optimal degree distributions for left-perfect matchings in random bipartite graphs (Q2354587) (← links)
- Generalized Post embedding problems (Q2354596) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Resilient Quicksort and Selection (Q2907482) (← links)
- General Quantitative Specification Theories with Modalities (Q2907483) (← links)
- The Complexity of Intersecting Finite Automata Having Few Final States (Q2907484) (← links)
- News about Semiantichains and Unichain Coverings (Q2907485) (← links)
- Checking Tests for Read-Once Functions over Arbitrary Bases (Q2907486) (← links)
- A Lower Bound on Circuit Complexity of Vector Function in U 2 (Q2907488) (← links)
- Computing All MOD-Functions Simultaneously (Q2907489) (← links)
- Bounded Synchronization Delay in Omega-Rational Expressions (Q2907490) (← links)
- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs (Q2907493) (← links)
- Worst-Case Optimal Priority Queues via Extended Regular Counters (Q2907494) (← links)
- The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs (Q2907495) (← links)
- Satisfiability Thresholds beyond k −XORSAT (Q2907497) (← links)
- Finding Vertex-Surjective Graph Homomorphisms (Q2907498) (← links)
- Broadcast Domination on Block Graphs in Linear Time (Q2907499) (← links)
- Characterizing Certain Topological Specifications (Q2907500) (← links)
- Descriptional Complexity of Operations on Alternating and Boolean Automata (Q2907501) (← links)
- Two-Way Automata Characterizations of L/poly versus NL (Q2907503) (← links)
- On the Advice Complexity of the Set Cover Problem (Q2907505) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q2907506) (← links)
- Space-Bounded Kolmogorov Extractors (Q2907507) (← links)
- Some Results on more Flexible Versions of Graph Motif (Q2907508) (← links)
- A Characterization of Cellular Automata Generated by Idempotents on the Full Shift (Q2907509) (← links)
- Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time (Q2907510) (← links)
- Boolean Composition of Visual Secret Sharing Schemes (Q2907511) (← links)
- The Equivalence of Sampling and Searching (Q3007612) (← links)
- Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity (Q3007613) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- On the Arithmetic Complexity of Euler Function (Q3007615) (← links)
- Faster Polynomial Multiplication via Discrete Fourier Transforms (Q3007620) (← links)
- Kolmogorov Complexity as a Language (Q3007621) (← links)
- Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs (Q3007622) (← links)