Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 28 results in range #1 to #28.
- Reoptimization of NP-Hard Problems: Label: en
- Second Thoughts on the Second Law: Label: en
- On the Advice Complexity of Online Edge- and Node-Deletion Problems: Label: en
- Rendezvous of Asynchronous Mobile Robots with Lights: Label: en
- Firefly-Inspired Algorithm for Job Shop Scheduling: Label: en
- $$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players: Label: en
- A Modern View on Stability of Approximation: Label: en
- Infinity and Finite Arithmetic: Label: en
- A Survey on the Complexity of Flood-Filling Games: Label: en
- What Is Known About Vertex Cover Kernelization?: Label: en
- A Dynamic Distributed Data Structure for Top-k and k-Select Queries: Label: en
- Online Matching in Regular Bipartite Graphs with Randomized Adversary: Label: en
- Small Complexity Gaps for Comparison-Based Sorting: Label: en
- Universal Hashing via Integer Arithmetic Without Primes, Revisited: Label: en
- Length-Weighted Disjoint Path Allocation: Label: en
- Relative Worst-Order Analysis: A Survey: Label: en
- Sequence Hypergraphs: Paths, Flows, and Cuts: Label: en
- Fully Online Matching with Advice on General Bipartite Graphs and Paths: Label: en
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem: Label: en
- Classical and Quantum Computations with Restricted Memory: Label: en
- Probabilism versus Alternation for Automata: Label: en
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity: Label: en
- On Usefulness of Information: Framework and NFA Case: Label: en
- Reaction Systems, Transition Systems, and Equivalences: Label: en
- Regularity of k-Abelian Equivalence Classes of Fixed Cardinality: Label: en
- Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols: Label: en
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity: Label: en
- Determinism and Nondeterminism in Finite Automata with Advice: Label: en