×

Found 159 Documents (Results 1–100)

Gaps, ambiguity, and establishing complexity-class containments via iterative constant-setting. (English) Zbl 07893095

Szeider, Stefan (ed.) et al., 47th international symposium on mathematical foundations of computer science, MFCS 2022, Vienna, Austria, August 22–26, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 241, Article 57, 15 p. (2022).
MSC:  68Qxx

Counting of teams in first-order team logics. (English) Zbl 1541.68153

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 19, 15 p. (2019).
MSC:  68Q19 03C13 68Q15

The robustness of LWPP and WPP, with an application to graph reconstruction. (English) Zbl 1512.68103

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 51, 14 p. (2018).
MSC:  68Q15 68R10

Parity separation: a scientifically proven method for permanent weight loss. (English) Zbl 1388.68221

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 47, 14 p. (2016).

Descriptive complexity of #AC\(^0\) functions. (English) Zbl 1369.68220

Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 20, 16 p. (2016).
MSC:  68Q19 68Q15

Monomials in arithmetic circuits: complete problems in the counting hierarchy. (English) Zbl 1245.68087

Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 362-373, electronic only (2012).
MSC:  68Q15 68Q17 68Q25
Full Text: DOI

Log-supermodular functions, functional clones and counting CSPs. (English) Zbl 1245.68100

Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 302-313, electronic only (2012).
MSC:  68Q25 68Q15
Full Text: DOI

Complexity dichotomies of counting problems. (English) Zbl 1253.68140

Ji, Lizhen (ed.) et al., Fifth international congress of Chinese mathematicians. Proceedings of the ICCM ’10, Beijing, China, December 17–22, 2010. Part 2. Providence, RI: American Mathematical Society (AMS); Somerville, MA: International Press (ISBN 978-0-8218-7587-2/pbk; 978-0-8218-7555-1/set). AMS/IP Studies in Advanced Mathematics 51, pt.2, 677-696 (2012).

Dependence logic with a majority quantifier. (English) Zbl 1246.68126

Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 252-263, electronic only (2011).
MSC:  68Q19 03C13 68Q15

The #CSP dichotomy is decidable. (English) Zbl 1230.68078

Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10–12, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPIcs – Leibniz International Proceedings in Informatics 9, 261-272, electronic only (2011).
MSC:  68Q15 68Q17

The complexity of weighted Boolean #CSP modulo \(k\). (English) Zbl 1230.68080

Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10–12, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPIcs – Leibniz International Proceedings in Informatics 9, 249-260, electronic only (2011).
MSC:  68Q15 68Q25

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software