Results 11 to 20 of about 33,182 (260)

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   +1 more source

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs [PDF]

, 2020
We consider two optimization problems in planar graphs. In MAXIMUM WEIGHT INDEPENDENT SET OF OBJECTS we are given a graph G and a family D of objects, each being a connected subgraph of G with a prescribed weight, and the task is to find a maximum-weight
Wiese, Andreas, Pilipczuk, Michal, Van Leeuwen, Erik Jan, Pilipczuk, Michał, Sub Algorithms and Complexity, van Leeuwen, E.J., Algorithms and Complexity, Leeuwen, Erik Jan van   +7 more
core   +1 more source

Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices [PDF]

, 2020
We survey a number of recent results that relate the fine-grained complexity of several NP-Hard problems with the rank of certain matrices. The main technical theme is that for a wide variety of Divide & Conquer algorithms, structural insights on ...
Nederlof, Jesper, Fomin, Fedor V., Sub Algorithms and Complexity, Kratsch, Stefan, Leeuwen, Erik Jan van, Algorithms and Complexity   +5 more
core   +2 more sources

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

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

Instance complexity of Boolean functions [PDF]

, 2023
In the area of query complexity of Boolean functions, the most widely studied cost measure of an algorithm is the worst-case number of queries made by it on an input.
Mande, Nikhil S., Liu, Alison
core  

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

Glassy Nature of the Hard Phase in Inference Problems

Physical Review X, 2019
An algorithmically hard phase is described in a range of inference problems: Even if the signal can be reconstructed with a small error from an information-theoretic point of view, known algorithms fail unless the noise-to-signal ratio is sufficiently ...
Fabrizio Antenucci, Silvio Franz, Pierfrancesco Urbani, Lenka Zdeborová   +3 more
doaj   +1 more source