Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Florian Enescu"'
Autor:
Alan Dills, Florian Enescu
Publikováno v:
Communications in Algebra. 51:1955-1968
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24407f2110d18cff483ef75e1199646e
https://doi.org/10.1080/00927872.2022.2148256
https://doi.org/10.1080/00927872.2022.2148256
Autor:
Florian Enescu, Arun Suresh
Publikováno v:
Communications in Algebra. 49:5083-5092
We present an explicit minimal set of generators for the defining ideal of the family of Backelin semigroups and find its Betti numbers. In particular, we compute the type of the semigroup as well,...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cab8373eeebafdf86d0ec312faec31a3
https://doi.org/10.1080/00927872.2021.1937637
https://doi.org/10.1080/00927872.2021.1937637
Publikováno v:
Journal of Algebra. 541:61-97
We construct explicitly a resolution of a fan algebra of principal ideals over a Noetherian ring for the case when the fan is a proper rational cone in the plane. Under some mild conditions on the initial data, we show that this resolution is minimal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a3d62442c97b82f432e5298fee1e187
https://doi.org/10.1016/j.jalgebra.2019.09.002
https://doi.org/10.1016/j.jalgebra.2019.09.002
Publikováno v:
VLSI-SoC
This paper addresses the rectification of faulty finite field arithmetic circuits by computing patch functions at internal nets using techniques from polynomial algebra. Contemporary approaches that utilize SAT solving and Craig interpolation are inf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f63b20e6e4bd6387393994a8b02e98b0
https://doi.org/10.1109/vlsi-soc53125.2021.9606976
https://doi.org/10.1109/vlsi-soc53125.2021.9606976
Publikováno v:
2021 IEEE 39th International Conference on Computer Design (ICCD).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5149a7536cca8a68e8c459244f37af6f
https://doi.org/10.1109/iccd53106.2021.00039
https://doi.org/10.1109/iccd53106.2021.00039
Publikováno v:
ISQED
Deciding whether a faulty circuit can be rectified at a given set of nets to match its intended specification constitutes a critical problem in post-verification debugging and rectification. Contemporary approaches which utilize Boolean SAT and Craig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::182e10de19a3d0a55eed13c9efbbeec1
https://doi.org/10.1109/isqed51717.2021.9424286
https://doi.org/10.1109/isqed51717.2021.9424286
Autor:
Yongwei Yao, Florian Enescu
Publikováno v:
Journal of Pure and Applied Algebra. 222:414-432
We compute the Frobenius complexity for the determinantal ring of prime characteristic $p$ obtained by modding out the $2 \times 2$ minors of an $m \times n$ matrix of indeterminates, where $m > n \ge 2$. We also show that, as $p \to \infty$, the Fro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40e6acbc27cf7c25237d5b1b62f3210a
https://doi.org/10.1016/j.jpaa.2017.04.011
https://doi.org/10.1016/j.jpaa.2017.04.011
Publikováno v:
ETS
When formal verification identifies the presence of a bug in a design, it is required to rectify the circuit at some net(s). Modern approaches formulate the rectification test as an unsatisfiability proof, and then use Craig interpolants (CI) in prop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::735506f50695a1b092a359d64aa15383
https://doi.org/10.1109/ets.2019.8791541
https://doi.org/10.1109/ets.2019.8791541
Publikováno v:
VLSI-SoC: Design and Engineering of Electronics Systems Based on New Computing Paradigms ISBN: 9783030234249
VLSI-SoC (Selected Papers)
VLSI-SoC (Selected Papers)
When formal verification of arithmetic circuits identifies the presence of a bug in the design, the task of rectification needs to be performed to correct the function implemented by the circuit so that it matches the given specification. In our rece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b05ceee5d22fdae6b59aa9bf42036fbd
https://doi.org/10.1007/978-3-030-23425-6_5
https://doi.org/10.1007/978-3-030-23425-6_5
Autor:
Irina Ilioaea, Florian Enescu
In this note, we use the theory of test ideals and Cartier algebras to examine the interplay between the tight and integral closures in a local ring of positive characteristic. Using work of Schwede, we prove the abundance of strong test ideals, reco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f70f1f74e41263a56ac5fdf117f1926