<div class="csl-bib-body">
<div class="csl-entry">Kaufmann, D. (2025, September 24). <i>Verifying Arithmetic Circuits with Polynomials</i> [Conference Presentation]. SYNASC 2025: 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania.</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/222828
-
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.language.iso
en
-
dc.subject
Computer Algebra
en
dc.subject
Hardware Verification
en
dc.subject
Arithmetic Circuits
en
dc.title
Verifying Arithmetic Circuits with Polynomials
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.relation.grantno
ESP 666-N
-
dc.type.category
Conference Presentation
-
tuw.publication.invited
invited
-
tuw.project.title
Wortbasiertes Reasoning mit Computeralgebra und SAT
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
-
tuw.event.name
SYNASC 2025: 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
en
tuw.event.startdate
22-09-2025
-
tuw.event.enddate
25-09-2025
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Timisoara
-
tuw.event.country
RO
-
tuw.event.presenter
Kaufmann, Daniela
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cp
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
item.fulltext
no Fulltext
-
item.openairetype
conference paper not in proceedings
-
item.languageiso639-1
en
-
crisitem.project.funder
FWF - Österr. Wissenschaftsfonds
-
crisitem.project.grantno
ESP 666-N
-
crisitem.author.dept
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
