Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/sat/FungT23
%A Fung, Long-Hin
%A Tan, Tony
%B SAT
%D 2023
%E Mahajan, Meena
%E Slivovsky, Friedrich
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 10:1-10:15
%T On the Complexity of k-DQBF.
%U http://dblp.uni-trier.de/db/conf/sat/sat2023.html#FungT23
%V 271
%@ 978-3-95977-286-0
@inproceedings{conf/sat/FungT23,
added-at = {2023-08-10T00:00:00.000+0200},
author = {Fung, Long-Hin and Tan, Tony},
biburl = {https://www.bibsonomy.org/bibtex/236fbe94e95fc66e35bea2eedcf582918/dblp},
booktitle = {SAT},
crossref = {conf/sat/2023},
editor = {Mahajan, Meena and Slivovsky, Friedrich},
ee = {https://doi.org/10.4230/LIPIcs.SAT.2023.10},
interhash = {2e0d2cbc0572d2dc8b0c4baaca2822fb},
intrahash = {36fbe94e95fc66e35bea2eedcf582918},
isbn = {978-3-95977-286-0},
keywords = {dblp},
pages = {10:1-10:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-08-26T07:29:44.000+0200},
title = {On the Complexity of k-DQBF.},
url = {http://dblp.uni-trier.de/db/conf/sat/sat2023.html#FungT23},
volume = 271,
year = 2023
}