Zobrazeno 1 - 10
of 349
pro vyhledávání: '"Buergisser P"'
Autor:
Bürgisser, Peter
The purpose of this overview is to explain the enormous impact of Les Valiant's eponymous short conference contribution from 1979 on the development of algebraic complexity.
Comment: 49 pages, 4 figures. To appear in "Foundations of Computation
Comment: 49 pages, 4 figures. To appear in "Foundations of Computation
Externí odkaz:
http://arxiv.org/abs/2406.06217
When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer science, optim
Externí odkaz:
http://arxiv.org/abs/2405.15368
Autor:
Bürgisser, Peter, Jindal, Gorav
The problem $\textrm{PosSLP}$ involves determining whether an integer computed by a given straight-line program is positive. This problem has attracted considerable attention within the field of computational complexity as it provides a complete char
Externí odkaz:
http://arxiv.org/abs/2307.08008
Autor:
Iris Miescher, Nicola Schaffner, Julia Rieber, Gabriella Meier Buergisser, Esteban Ongini, Yao Yang, Athanasios Milionis, Viola Vogel, Jess G. Snedeker, Maurizio Calcagni, Johanna Buschmann
Publikováno v:
Data in Brief, Vol 57, Iss , Pp 111069- (2024)
As one major problem after tendon rupture repair, surgeons are confronted with fibrotic adhesion formation of the healing tendon to the surrounding tissue. Although early active motion is recommended during rehabilitation, adhesions may lead to joint
Externí odkaz:
https://doaj.org/article/9125fe3a62224afb9d4387f7ab35b91b
Autor:
Bürgisser, Peter
Publikováno v:
International Symposium on Symbolic and Algebraic Computation 2023 (ISSAC 2023), July 24-27, 2023, Tromso, Norway. ACM, New York, NY, USA
Consider a system $f_1(x)=0,\ldots,f_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $f_i$ has a prescribed set of exponent vectors described by a set $A_i \subseteq \mathbb{Z}^n$ of cardinality $t_i$, whose convex hull is denoted
Externí odkaz:
http://arxiv.org/abs/2301.00273
Let $K$ be a nonarchimedean local field of characteristic zero with valuation ring $R$, for instance, $K=\mathbb{Q}_p$ and $R=\mathbb{Z}_p$. We prove a general integral geometric formula for $K$-analytic groups and homogeneous $K$-analytic spaces, an
Externí odkaz:
http://arxiv.org/abs/2206.03708
Publikováno v:
Advances in Mathematics, Vol. 402, 25 June 2022, 108361
We show that every multilinear map between Euclidean spaces induces a unique, continuous, Minkowski multilinear map of the corresponding real cones of zonoids. Applied to the wedge product of the exterior algebra of a Euclidean space, this yields a m
Externí odkaz:
http://arxiv.org/abs/2109.14996
Publikováno v:
36th Computational Complexity Conference (CCC 2021), 32:1--32:30 (2021)
An action of a group on a vector space partitions the latter into a set of orbits. We consider three natural and useful algorithmic "isomorphism" or "classification" problems, namely, orbit equality, orbit closure intersection, and orbit closure cont
Externí odkaz:
http://arxiv.org/abs/2102.07727
Autor:
Lukas Näf, Iris Miescher, Lara Pfuderer, Tiziano A. Schweizer, David Brunner, Johannes Dürig, Olivier Gröninger, Julia Rieber, Gabriella Meier-Buergisser, Katharina Spanaus, Maurizio Calcagni, Philipp P. Bosshard, Yvonne Achermann, Wendelin J. Stark, Johanna Buschmann
Publikováno v:
Heliyon, Vol 10, Iss 5, Pp e27267- (2024)
Large bone defects after trauma demand for adequate bone substitutes. Bone void fillers should be antibacterial and pro-angiogenic. One viable option is the use of composite materials like the combination of PLGA and amorphous calcium phosphate (aCaP
Externí odkaz:
https://doaj.org/article/130efdffc00c40b7bad796c30a621970
Publikováno v:
Forum of Mathematics, Pi, Volume 11, 2023 , e12
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that computes, with h
Externí odkaz:
http://arxiv.org/abs/2010.10997