Computability Models: Algebraic, Topological and Geometric Algorithms
From MaRDI portal
Publication:5886546
DOI10.1090/CONM/783/15733OpenAlexW4323646272MaRDI QIDQ5886546FDOQ5886546
Authors: Jane Gilman 
Publication date: 5 April 2023
Published in: Computational Aspects of Discrete Subgroups of Lie Groups (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.05779
Recommendations
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
- Geometric algorithms for discreteness and faithfulness
- scientific article; zbMATH DE number 1532401
- A discreteness algorithm for 4-punctured sphere groups
- The constructive membership problem for discrete two-generator subgroups of \(\operatorname{SL}_2(\mathbb{R})\)
Cites Work
- Elementary geometry in hyperbolic space
- Title not available (Why is that?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of a Computer Implementation of Poincare's Theorem on Fundamental Polyhedra
- Two-generator discrete subgroups of 𝑃𝑆𝐿(2,𝑅)
- Computing over the reals: foundations for scientific computing.
- Computability in linear algebra
- Cusps are dense
- A NOTE ON SUBGROUPS OF SL(2, C)
- Computability of Julia sets
- An algorithm for 2-generator Fuchsian groups
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
- Computer Algebra of Polynomials and Rational Functions
- A rough fundamental domain for Teichmüller spaces
- Discreteness is undecidable
- New Computational Paradigms
- The non-Euclidean Euclidean algorithm
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Computability Models: Algebraic, Topological and Geometric Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886546)
