Browsing by MSC "68"
Now showing items 21-40 of 95
-
1206 - Computability Theory
[OWR-2012-8] (2012) - (05 Feb - 11 Feb 2012)Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong ... -
1802 - Computability Theory
[OWR-2018-1] (2018) - (07 Jan - 13 Jan 2018)Computability and computable enumerability are two of the fundamental notions of mathematics. Interest in effectiveness is already apparent in the famous Hilbert problems, in particular the second and tenth, and in early ... -
2117 - Computability Theory (hybrid meeting)
[OWR-2021-21] (2021) - (25 Apr - 01 May 2021)Over the last decade computability theory has seen many new and fascinating developments that have linked the subject much closer to other mathematical disciplines inside and outside of logic. This includes, for instance, ... -
1542 - Computational Geometric and Algebraic Topology
[OWR-2015-45] (2015) - (11 Oct - 17 Oct 2015)Computational topology is a young, emerging field of mathematics that seeks out practical algorithmic methods for solving complex and fundamental problems in geometry and topology. It draws on a wide variety of techniques ... -
1631 - Computational Group Theory
[OWR-2016-37] (2016) - (31 Jul - 06 Aug 2016)This was the seventh workshop on Computational Group Theory. It showed that Computational Group Theory has significantly expanded its range of activities. For example, symbolic computations with groups and their representations ... -
0627 - Computational Group Theory
[OWR-2006-30] (2006) - (02 Jul - 08 Jul 2006)This workshop on Computational Group Theory revealed the close connections between its main themes “finitely presented groups”, “permutation groups”, “matrix groups” and “representations of groups”. The meeting also presented ... -
1131 - Computational Group Theory
[OWR-2011-37] (2011) - (31 Jul - 06 Aug 2011)This sixth workshop on Computational Group Theory proved that its main themes “finitely presented groups”, “$p$-groups”, “matrix groups” and “representations of groups” are lively and active fields of research. The talks ... -
2523 - Computational Group Theory
[OWR-2025-27] (2025) - (01 Jun - 06 Jun 2025)This was the ninth Oberwolfach Workshop on Computational Group Theory. It demonstrated the deep and interesting interactions between theoretical results and powerful practical algorithms in Computational Group Theory. ... -
2133 - Computational Group Theory (hybrid meeting)
[OWR-2021-38] (2021) - (15 Aug - 21 Aug 2021)This was the eighth Oberwolfach Workshop on Computational Group Theory. It demonstrated how an increasing number and variety of deep theoretical results are being used to devise powerful and practical algorithms ... -
1610 - Computationally and Statistically Efficient Inference for Complex Large-scale Data
[OWR-2016-16] (2016) - (06 Mar - 12 Mar 2016)The aim of the highly successful workshop Computationally and statistically efficient inference for large-scale and heterogeneous data was to foster dissemination and collaboration between researchers in the area of ... -
Computing Congruence Quotients of Zariski Dense Subgroups
[OWP-2018-22] (Mathematisches Forschungsinstitut Oberwolfach, 2018-10-26)We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq ... -
0949 - Convex Geometry and its Applications
[OWR-2009-53] (2009) - (29 Nov - 05 Dec 2009)The geometry of convex domains in Euclidean space plays a central role in several branches of mathematics: functional and harmonic analysis, the theory of PDE, linear programming and, increasingly, in the study of other ... -
1850 - Convex Geometry and its Applications
[OWR-2018-54] (2018) - (09 Dec - 15 Dec 2018)The geometry of convex domains in Euclidean space plays a central role in several branches of mathematics: functional and harmonic analysis, the theory of PDE, linear programming and, increasingly, in the study of algorithms ... -
1250 - Convex Geometry and its Applications
[OWR-2012-59] (2012) - (09 Dec - 15 Dec 2012)The geometry of convex domains in Euclidean space plays a central role in several branches of mathematics: functional and harmonic analysis, the theory of PDE, linear programming and, increasingly, in the study of other ... -
1550 - Convex Geometry and its Applications
[OWR-2015-56] (2015) - (06 Dec - 12 Dec 2015)The past 30 years have not only seen substantial progress and lively activity in various areas within convex geometry, e.g., in asymptotic geometric analysis, valuation theory, the $L_p$-Brunn-Minkowski theory and stochastic ... -
2451 - Convex Geometry and its Applications
[OWR-2024-58] (2024) - (15 Dec - 20 Dec 2024)The geometry of convex domains in Euclidean space plays a central role in several branches of mathematics: functional and harmonic analysis, the theory of PDEs, linear programming and, increasingly, in the study ... -
2150 - Convex Geometry and its Applications (hybrid meeting)
[OWR-2021-59] (2021) - (12 Dec - 18 Dec 2021)The geometry of convex domains in Euclidean space plays a central role in several branches of mathematics: functional and harmonic analysis, the theory of PDE, linear programming and, increasingly, in the study of ... -
1431 - Cryptography
[OWR-2014-35] (2014) - (27 Jul - 02 Aug 2014)The Oberwolfach workshop Cryptography brought together scientists from cryptography with mathematicians specializing in the algorithmic problems underlying cryptographic security. The goal of the workshop was to stimulate ... -
2504 - Cryptography
[OWR-2025-3] (2025) - (19 Jan - 24 Jan 2025)The science of cryptography lies at the very foundations of trust in current and future systems and devices for communication and computation. For example, secure communications over the internet today are possible thanks ... -
Deciding Non-Freeness of Rational Möbius Groups
[OWP-2022-07] (Mathematisches Forschungsinstitut Oberwolfach, 2022-03-22)We explore a new computational approach to a classical problem: certifying non-freeness of (2-generator, parabolic) Möbius subgroups of SL(2, $\mathbb{Q}$). The main tools used are algorithms for Zariski dense groups and ...