×

Found 856 Documents (Results 1–100)

100
MathJax

Subsampling and knowledge distillation on adversarial examples: new techniques for deep learning based side channel evaluations. (English) Zbl 07498235

Dunkelman, Orr (ed.) et al., Selected areas in cryptography. 27th international conference, Halifax, NS, Canada (virtual event), October 21–23, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12804, 567-592 (2021).
MSC:  68Txx 68P25 94A60
PDF BibTeX XML Cite
Full Text: DOI

Scalable SAT solving in the cloud. (English) Zbl 07495595

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 518-534 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Efficient SAT-based minimal model generation methods for modal logic S5. (English) Zbl 07495576

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 225-241 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Solving non-uniform planted and filtered random SAT formulas greedily. (English) Zbl 07495573

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 188-206 (2021).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Zero-correlation linear cryptanalysis with equal treatment for plaintexts and tweakeys. (English) Zbl 1479.94238

Paterson, Kenneth G. (ed.), Topics in cryptology – CT-RSA 2021. Cryptographers’ track at the RSA conference 2021, virtual event, May 17–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12704, 126-147 (2021).
MSC:  94A60
PDF BibTeX XML Cite
Full Text: DOI

Algorithms and lower bounds for de Morgan formulas of low-communication leaf gates. (English) Zbl 07561743

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 15, 41 p. (2020).
MSC:  68Q25
PDF BibTeX XML Cite
Full Text: DOI

Super strong ETH is true for PPSZ with small resolution width. (English) Zbl 07561731

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 3, 12 p. (2020).
MSC:  68Q25
PDF BibTeX XML Cite
Full Text: DOI

Cooperative parallel SAT local search with path relinking. (English) Zbl 1484.68218

Paquete, Luís (ed.) et al., Evolutionary computation in combinatorial optimization. 20th European conference, EvoCOP 2020, held as part of EvoStar 2020, Seville, Spain, April 15–17, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12102, 83-98 (2020).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI

LaserTank is NP-complete. (English) Zbl 07441080

Slamanig, Daniel (ed.) et al., Mathematical aspects of computer and information sciences. 8th international conference, MACIS 2019, Gebze, Turkey, November 13–15, 2019. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11989, 333-338 (2020).
MSC:  68-XX 65-XX
PDF BibTeX XML Cite
Full Text: DOI arXiv

Incremental encoding of pseudo-Boolean goal functions based on comparator networks. (English) Zbl 07331043

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 519-535 (2020).
MSC:  68Q25 68R07 68T20
PDF BibTeX XML Cite
Full Text: DOI

Using merging variables-based local search to solve special variants of MaxSAT problem. (English) Zbl 1460.90155

Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 363-378 (2020).
MSC:  90C27 90C09
PDF BibTeX XML Cite
Full Text: DOI

Sparse hashing for scalable approximate model counting: theory and practice. (English) Zbl 07299508

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 728-741 (2020).
MSC:  68-XX
PDF BibTeX XML Cite
Full Text: DOI arXiv

Fast sampling and counting \(k\)-SAT solutions in the local lemma regime. (English) Zbl 07298293

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 854-867 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Practical implementation of a quantum backtracking algorithm. (English) Zbl 1440.68098

Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 597-606 (2020).
MSC:  68Q12 68R07 68R10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Revised version of block cipher CHAM. (English) Zbl 1446.68065

Seo, Jae Hong (ed.), Information security and cryptology – ICISC 2019. 22nd international conference, Seoul, South Korea, December 4–6, 2019. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11975, 1-19 (2020).
MSC:  68P25 94A60
PDF BibTeX XML Cite
Full Text: DOI

Short proofs are hard to find. (English) Zbl 07561577

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 84, 16 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

The satisfiability threshold for non-uniform random 2-SAT. (English) Zbl 07561554

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 61, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Quadratic time-space lower bounds for computing natural functions with a random oracle. (English) Zbl 07559099

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 56, 20 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

A #SAT algorithm for small constant-depth circuits with PTF gates. (English) Zbl 07559051

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 8, 20 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

A general method for forbidden induced subgraph sandwich problem NP-completeness. (English) Zbl 07515197

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 393-400 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

A note on universal point sets for planar graphs. (English) Zbl 07266128

Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 350-362 (2019).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI

Phase transition in matched formulas and a heuristic for biclique satisfiability. (English) Zbl 1445.68200

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 108-121 (2019).
MSC:  68T20 68R07
PDF BibTeX XML Cite
Full Text: DOI arXiv

Black-box optimization in an extended search space for SAT solving. (English) Zbl 1444.90079

Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11548, 402-417 (2019).
MSC:  90C09 90C59
PDF BibTeX XML Cite
Full Text: DOI

A SAT-based encoding of the one-pass and tree-shaped tableau system for LTL. (English) Zbl 1435.68368

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 3-20 (2019).
PDF BibTeX XML Cite
Full Text: DOI Link

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software