The following pages link to Logic and Theory of Algorithms (Q3507413):
Displayed 50 items.
- Program Schemes with Deep Pushdown Storage (Q3507414) (← links)
- Herbrand Theorems and Skolemization for Prenex Fuzzy Logics (Q3507415) (← links)
- Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL (Q3507416) (← links)
- Pure Iteration and Periodicity (Q3507417) (← links)
- Programming Experimental Procedures for Newtonian Kinematic Machines (Q3507418) (← links)
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Q3507419) (← links)
- A Summation Algorithm from 11th Century China (Q3507420) (← links)
- Sequential Automatic Algebras (Q3507421) (← links)
- The Role of Classical Computation in Measurement-Based Quantum Computation (Q3507422) (← links)
- The Algebraic Counterpart of the Wagner Hierarchy (Q3507423) (← links)
- Computing by Observing: A Brief Survey (Q3507424) (← links)
- A Quantum Information-Theoretic Proof of the Relation between Horn’s Problem and the Littlewood-Richardson Coefficients (Q3507425) (← links)
- Pell Equations and Weak Regularity Principles (Q3507426) (← links)
- Computable Categoricity of Graphs with Finite Components (Q3507427) (← links)
- P Automata: Membrane Systems as Acceptors (Q3507428) (← links)
- Computing Equilibria in Large Games We Play (Q3507429) (← links)
- A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC (Q3507430) (← links)
- Phase Transitions for Weakly Increasing Sequences (Q3507431) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- Describing the Wadge Hierarchy for the Alternation Free Fragment of μ-Calculus (I) (Q3507433) (← links)
- Subrecursive Complexity of Identifying the Ramsey Structure of Posets (Q3507434) (← links)
- Solving Simple Stochastic Games (Q3507435) (← links)
- The Shrinking Property for NP and coNP (Q3507436) (← links)
- On the Hardness of Truthful Online Auctions with Multidimensional Constraints (Q3507437) (← links)
- Effective Dimensions and Relative Frequencies (Q3507438) (← links)
- Reachability in Linear Dynamical Systems (Q3507439) (← links)
- Hybrid Functional Interpretations (Q3507440) (← links)
- The Algorithm Concept – Tool for Historiographic Interpretation or Red Herring? (Q3507441) (← links)
- Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion (Q3507442) (← links)
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games (Q3507443) (← links)
- Implementing Spi Calculus Using Nominal Techniques (Q3507444) (← links)
- An Enhanced Theory of Infinite Time Register Machines (Q3507445) (← links)
- Many Facets of Complexity in Logic (Q3507446) (← links)
- On the Computational Power of Enhanced Mobile Membranes (Q3507447) (← links)
- Recursion in Higher Types and Resource Bounded Turing Machines (Q3507448) (← links)
- Computability and Complexity in Self-assembly (Q3507449) (← links)
- Extraction in Coq: An Overview (Q3507450) (← links)
- Joining to High Degrees (Q3507451) (← links)
- Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem (Q3507452) (← links)
- Interpreting Localized Computational Effects Using Operators of Higher Type (Q3507453) (← links)
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants (Q3507454) (← links)
- Updatable Timed Automata with Additive and Diagonal Constraints (Q3507456) (← links)
- First-Order Model Checking Problems Parameterized by the Model (Q3507457) (← links)
- Domain Theory and the Causal Structure of Space-Time (Q3507458) (← links)
- Recursion on Nested Datatypes in Dependent Type Theory (Q3507459) (← links)
- Perfect Local Computability and Computable Simulations (Q3507461) (← links)
- Complete Determinacy and Subsystems of Second Order Arithmetic (Q3507462) (← links)
- Internal Density Theorems for Hierarchies of Continuous Functionals (Q3507463) (← links)
- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem (Q3507464) (← links)
- The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF (Q3507465) (← links)