DC Field
Value
Language
dc.contributor.author
Slivovsky, Friedrich
-
dc.date.accessioned
2023-02-21T13:52:09Z
-
dc.date.available
2023-02-21T13:52:09Z
-
dc.date.issued
2022
-
dc.identifier.citation
<div class="csl-bib-body"> <div class="csl-entry">Slivovsky, F. (2022). <i>QBF Solvers and their Proof Complexity</i> [Conference Presentation]. Proof Complexity Workshop 2022, Israel.</div> </div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/153794
-
dc.language.iso
en
-
dc.subject
QBF
en
dc.title
QBF Solvers and their Proof Complexity
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.type.category
Conference Presentation
-
tuw.publication.invited
invited
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.event.name
Proof Complexity Workshop 2022
en
tuw.event.startdate
31-07-2022
-
tuw.event.enddate
01-08-2022
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.country
IL
-
tuw.event.presenter
Slivovsky, Friedrich
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.grantfulltext
none
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cp
-
item.openairetype
conference paper not in proceedings
-
item.languageiso639-1
en
-
item.cerifentitytype
Publications
-
item.fulltext
no Fulltext
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
Appears in Collections:
Presentation
Show simple item record

Page view(s)

154
checked on Nov 23, 2023

Google ScholarTM

Check