Record link: 
http://hdl.handle.net/20.500.12708/153791
-
Title: 
The Parameterized Complexity of SAT
en
Citation: 
Szeider, S. (2022). The Parameterized Complexity of SAT [Conference Presentation]. Workshop Parameterized Complexity of Computational Reasoning (PCCR 2022), Israel.
-
Publication Type: 
Presentation - Conference Presentation
en
Language: 
English
-
Authors: 
Szeider, Stefan 
-
Organisational Unit: 
E192-01 - Forschungsbereich Algorithms and Complexity 
-
Date (published): 
2022
-
Event name: 
Workshop Parameterized Complexity of Computational Reasoning (PCCR 2022) 
-
Event date: 
31-Jul-2022 - 1-Aug-2022
-
Event place: 
Israel
-
Keywords: 
Propositional Satisfiability
en
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
1020 - Informatik: 80%
1010 - Mathematik: 20%
-
Appears in Collections:
Presentation

Thumbnail
(Graphical) Abstract
Adobe PDF
(12.89 MB)
Open Access In Copyright 1.0
Show full item record

Page view(s)

126
checked on Nov 23, 2023

Download(s)

44
checked on Nov 23, 2023

Google ScholarTM

Check