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

How We Think of Computing Today: Label: en
Principal Typings for Explicit Substitutions Calculi: Label: en
Cupping Classes of $\Sigma^0_2$ Enumeration Degrees: Label: en
ω-Degree Spectra: Label: en
Complexity of Aperiodicity for Topological Properties of Regular ω-Languages: Label: en
Topological Dynamics of 2D Cellular Automata: Label: en
The Quantum Complexity of Markov Chain Monte Carlo: Label: en
Union of Reducibility Candidates for Orthogonal Constructor Rewriting: Label: en
Upper Semilattices in Many-One Degrees: Label: en
The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF: Label: en
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem: Label: en
Internal Density Theorems for Hierarchies of Continuous Functionals: Label: en
Complete Determinacy and Subsystems of Second Order Arithmetic: Label: en
Perfect Local Computability and Computable Simulations: Label: en
Recursion on Nested Datatypes in Dependent Type Theory: Label: en
Domain Theory and the Causal Structure of Space-Time: Label: en
First-Order Model Checking Problems Parameterized by the Model: Label: en
Updatable Timed Automata with Additive and Diagonal Constraints: Label: en
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants: Label: en
Interpreting Localized Computational Effects Using Operators of Higher Type: Label: en
Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem: Label: en
Joining to High Degrees: Label: en
Extraction in Coq: An Overview: Label: en
Computability and Complexity in Self-assembly: Label: en
Recursion in Higher Types and Resource Bounded Turing Machines: Label: en
On the Computational Power of Enhanced Mobile Membranes: Label: en
Many Facets of Complexity in Logic: Label: en
An Enhanced Theory of Infinite Time Register Machines: Label: en
Implementing Spi Calculus Using Nominal Techniques: Label: en
A Simple P-Matrix Linear Complementarity Problem for Discounted Games: Label: en
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion: Label: en
The Algorithm Concept – Tool for Historiographic Interpretation or Red Herring?: Label: en
Hybrid Functional Interpretations: Label: en
Reachability in Linear Dynamical Systems: Label: en
Effective Dimensions and Relative Frequencies: Label: en
On the Hardness of Truthful Online Auctions with Multidimensional Constraints: Label: en
The Shrinking Property for NP and coNP: Label: en
Solving Simple Stochastic Games: Label: en
Subrecursive Complexity of Identifying the Ramsey Structure of Posets: Label: en
Describing the Wadge Hierarchy for the Alternation Free Fragment of μ-Calculus (I): Label: en
Succinct NP Proofs from an Extractability Assumption: Label: en
Phase Transitions for Weakly Increasing Sequences: Label: en
A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC: Label: en
Computing Equilibria in Large Games We Play: Label: en
P Automata: Membrane Systems as Acceptors: Label: en
Computable Categoricity of Graphs with Finite Components: Label: en
Pell Equations and Weak Regularity Principles: Label: en
A Quantum Information-Theoretic Proof of the Relation between Horn’s Problem and the Littlewood-Richardson Coefficients: Label: en
Computing by Observing: A Brief Survey: Label: en
The Algebraic Counterpart of the Wagner Hierarchy: Label: en