Pages that link to "Item:Q2842766"
From MaRDI portal
The following pages link to Fundamentals of Computation Theory (Q2842766):
Displaying 50 items.
- Functions that preserve p-randomness (Q393087) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- On the Complexity of Finding a Largest Common Subtree of Bounded Degree (Q2842767) (← links)
- On the Isomorphism Problem for Decision Trees and Decision Lists (Q2842768) (← links)
- Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree (Q2842769) (← links)
- One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata (Q2842771) (← links)
- Efficient Sampling of Non-strict Turnstile Data Streams (Q2842772) (← links)
- The Frequent Items Problem in Online Streaming under Various Performance Measures (Q2842773) (← links)
- On the Average Size of Glushkov and Equation Automata for KAT Expressions (Q2842774) (← links)
- An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem (Q2842775) (← links)
- Expressivity of Time-Varying Graphs (Q2842776) (← links)
- Parameterized Complexity of Weak Odd Domination Problems (Q2842778) (← links)
- Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree (Q2842779) (← links)
- A Formal Framework for Property-Driven Obfuscation Strategies (Q2842780) (← links)
- Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy (Q2842781) (← links)
- Cancellation-Free Circuits in Unbounded and Bounded Depth (Q2842782) (← links)
- The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design (Q2842783) (← links)
- On Independence Domination (Q2842784) (← links)
- Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks (Q2842785) (← links)
- New Sequential and Parallel Algorithms for Computing the β-Spectrum (Q2842786) (← links)
- Approximation Algorithms for the Antenna Orientation Problem (Q2842787) (← links)
- Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation (Q2842788) (← links)
- An Axiomatization of the Theory of Generalized Ultrametric Semilattices of Linear Signals (Q2842789) (← links)
- On the Structure of Equilibria in Basic Network Formation (Q2842790) (← links)
- Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs (Q2842791) (← links)
- Groups with a Recursively Enumerable Irreducible Word Problem (Q2842792) (← links)
- Real-Time Vector Automata (Q2842793) (← links)
- Guarding Thin Orthogonal Polygons Is Hard (Q2842794) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS (Q2947866) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- On the Enumeration of Permutominoes (Q2947868) (← links)
- $$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$ (Q2947870) (← links)
- Depth, Highness and DNR Degrees (Q2947871) (← links)
- On the Expressive Power of Read-Once Determinants (Q2947872) (← links)
- Constructive Relationships Between Algebraic Thickness and Normality (Q2947873) (← links)
- On the Structure of Solution-Graphs for Boolean Formulas (Q2947874) (← links)
- Interprocedural Reachability for Flat Integer Programs (Q2947875) (← links)
- Complexity of Suffix-Free Regular Languages (Q2947876) (← links)
- Alternation Hierarchies of First Order Logic with Regular Predicates (Q2947877) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
- Incremental Complexity of a Bi-objective Hypergraph Transversal Problem (Q2947881) (← links)
- Pairs Covered by a Sequence of Sets (Q2947882) (← links)
- Recurring Comparison Faults: Sorting and Finding the Minimum (Q2947883) (← links)
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)
- $$\epsilon $$-Almost Selectors and Their Applications (Q2947885) (← links)
- Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
- On the Mathematics of Data Centre Network Topologies (Q2947887) (← links)
- Privacy in Elections: k-Anonymizing Preference Orders (Q2947888) (← links)
