Entity usage

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 35 results in range #1 to #35.

Cost-Sensitive Classification with Unconstrained Influence Diagrams: Label: en
Knowledge Compilation with Empowerment: Label: en
Securing the Future — An Information Flow Analysis of a Distributed OO Language: Label: en
Optimizing Segment Based Document Protection: Label: en
Factorization for Component-Interaction Automata: Label: en
An Algorithm for Probabilistic Alternating Simulation: Label: en
Complete Problem for Perfect Zero-Knowledge Quantum Proof: Label: en
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3: Label: en
The Complexity of Small Universal Turing Machines: A Survey: Label: en
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs: Label: en
Parikh’s Theorem and Descriptional Complexity: Label: en
On the Approximation Ratio of the Path Matching Christofides Algorithm: Label: en
Iterated Hairpin Completions of Non-crossing Words: Label: en
Counting Maximal Independent Sets in Subcubic Graphs: Label: en
A Fast Approximation Scheme for the Multiple Knapsack Problem: Label: en
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts: Label: en
4-Coloring H-Free Graphs When H Is Small: Label: en
Consistent Consequence for Boolean Equation Systems: Label: en
A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators: Label: en
Visibly Pushdown Transducers with Look-Ahead: Label: en
Multitape NFA: Weak Synchronization of the Input Heads: Label: en
Complexity of Model Checking for Modal Dependence Logic: Label: en
Randomized Group Testing Both Query-Optimal and Minimal Adaptive: Label: en
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration: Label: en
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs: Label: en
Properties of SLUR Formulae: Label: en
A Turing Machine Resisting Isolated Bursts of Faults: Label: en
Complexity Insights of the Minimum Duplication Problem: Label: en
The Equational Theory of Weak Complete Simulation Semantics over BCCSP: Label: en
Not Another Look at the Turing Test!: Label: en
Cryptography from Learning Parity with Noise: Label: en
Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test: Label: en
What Is an Algorithm?: Label: en
Turing Machines for Dummies: Label: en
The Legacy of Turing in Numerical Analysis: Label: en