Results 11 to 20 of about 11,198,718 (212)

Complexity Framework for Forbidden Subgraphs [PDF]

, 2022
For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H1,…,Hp as a subgraph. Similar to known meta-classifications for the minor and topological minor relations, we give a meta-classification for the subgraph ...
Oostveen, Jelle, van Leeuwen, Erik Jan, Johnson, Matthew S., Smith, Siani, Pandey, Sukanya, Paulusma, Daniël, Sub Algorithms and Complexity, Martin, Barnaby, Algorithms and Complexity   +8 more
core   +2 more sources

Complexity of independency and cliquy trees [PDF]

, 2020
An independency (cliquy) tree of an -vertex graph is a spanning tree of in which the set of leaves induces an independent set (clique). We study the problems of minimizing or maximizing the number of leaves of such trees, and fully characterize their ...
Sánchez Villaamil, Fernando, Gobbert, Moritz, Kuinke, Philipp, Schmid, Markus L., Fernau, Henning, Casel, Katrin, Dreier, Jan, Sub Algorithms and Complexity, van Leeuwen, E.J., Algorithms and Complexity   +9 more
core   +2 more sources

Institutional complexity is complexity with an adjective

, 2021
A review of the studies on institutional complexity reveals that the many definitions of institutional complexity and related concepts share similarities with the understanding of complexity and complex systems of complexity science. Yet few publications
Papin, Marielle
core   +1 more source

Fast algorithm for computer complex number-theoretic transforms

Electronics Letters, 1977
A high-radix FFT algorithm for computing transforms over FFT, where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
I.S. Reed, K.Y. Liu, T.K. Truong
openaire   +1 more source

Faster Bootstrapping via Modulus Raising and Composite NTT

Transactions on Cryptographic Hardware and Embedded Systems, 2023
FHEW-like schemes utilize exact gadget decomposition to reduce error growth and ensure that the bootstrapping incurs only polynomial error growth. However, the exact gadget decomposition method requires higher computation complexity and larger memory ...
Zhihao Li, Ying Liu, Xianhui Lu, Ruida Wang, Benqiang Wei, Chunling Chen, Kunpeng Wang   +6 more
doaj   +1 more source

Typical Sequences Revisited - Computing Width Parameters of Graphs [PDF]

, 2020
In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized algorithms for treewidth and ...
Bläser, Markus, Jaffke, Lars, Telle, Jan Arne, Bodlaender, Hans L., Sub Algorithms and Complexity, Paul, Christophe, Algorithms and Complexity   +6 more
core   +2 more sources

Area-Efficient Polynomial Multiplication Hardware Implementation for Lattice-based Cryptography [PDF]

Jisuanji gongcheng
Lattice-based post-quantum cryptography algorithms demonstrate significant potential in public-key cryptography. A key performance bottleneck in hardware implementation is the computational complexity of polynomial multiplication. To address the problems
XIE Jiaxing, PU Jinwei, FANG Weitian, ZHENG Xin, XIONG Xiaoming
doaj   +1 more source

Parameterized Complexity Results for Bayesian Inference [PDF]

, 2022
We present completeness results for inference in Bayesian networks with respect to two different parameterizations, namely the number of variables and the topological vertex separation number.
Donselaar, Nils, Kwisthout, Johan, Sub Algorithms and Complexity, Bodlaender, Hans, Algorithms and Complexity   +4 more
core   +1 more source

Efficient Simulation of High-Level Quantum Gates [PDF]

Quantum
Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators.
Adam Husted Kjelstrøm, Andreas Pavlogiannis, Jaco van de Pol   +2 more
doaj   +1 more source

Highly Efficient Architecture of NewHope-NIST on FPGA using Low-Complexity NTT/INTT

Transactions on Cryptographic Hardware and Embedded Systems, 2020
NewHope-NIST is a promising ring learning with errors (RLWE)-based postquantum cryptography (PQC) for key encapsulation mechanisms. The performance on the field-programmable gate array (FPGA) affects the applicability of NewHope-NIST.
Neng Zhang, Bohan Yang, Chen Chen, Shouyi Yin, Shaojun Wei, Leibo Liu   +5 more
doaj   +1 more source