Results 21 to 30 of about 33,182 (260)

Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography

Transactions on Cryptographic Hardware and Embedded Systems, 2020
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively.
Jose Maria Bermudo Mera, Angshuman Karmakar, Ingrid Verbauwhede   +2 more
doaj   +1 more source

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around [PDF]

, 2018
A fundamental graph problem is to recognize whether the vertex set of a graph G can be bipartitioned into sets A and B such that G[A] and G[B] satisfy properties Pi_A and Pi_B, respectively.
Herman, Grzegorz, van Leeuwen, Erik Jan, Bast, Hannah, Komusiewicz, Christian, Azar, Yossi, Kanj, Iyad, Sorge, Manuel, Kanj, Iyad A., Sub Algorithms and Complexity, Leeuwen, Erik Jan van, Algorithms and Complexity   +10 more
core   +1 more source

Parameterized Complexity Results for Bayesian Inference

, 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

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem [PDF]

, 2023
We study Steiner Forest on H-subgraph-free graphs, that is, graphs that do not contain some fixed graph H as a (not necessarily induced) subgraph. We are motivated by a recent framework that completely characterizes the complexity of many problems on H ...
Oostveen, Jelle, van Leeuwen, Erik Jan, Johnson, Matthew, Smith, Siani, Bodlaender, Hans L., Pandey, Sukanya, Paulusma, Daniël, Martin, Barnaby   +7 more
core  

Efficient computation of the Shapley value for game-theoretic network centrality [PDF]

, 2013
The Shapley value—probably the most important normative payoff division scheme in coalitional games—has recently been advocated as a useful measure of centrality in net-works.
Michalak, T, Piotr L. Szczepański, Aaditha, K. V., Szczepanski, P. L., Balaraman Ravindran, Tomasz P. Michalak, Jennings, N. R., Aaditha, KV, Nicholas R. Jennings, Michalak, Tomasz, Karthik V. Aadithya, Ravindran, B, Jennings, NR, Szczepanski, PL   +13 more
core   +1 more source

Algorithms and Bounds for Very Strong Rainbow Coloring [PDF]

, 2018
A well-studied coloring problem is to assign colors to the edges of a graph G so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in such a coloring is
van Leeuwen, E., Chandran, Sunil L, Das, A., van Leeuwen, Erik Jan, Mosteiro, Miguel A., Chandran, L. Sunil, Chandran, L., Bender, Michael A., Farach-Colton, Martin, Issac, D., Erik Jan van Leeuwen, Leeuwen, Erik Jan van, Davis Issac, Das, Anita, Anita Das, Issac, Davis, Sub Algorithms and Complexity, L. Sunil Chandran, Algorithms and Complexity   +18 more
core   +1 more source

Practical divide-and-conquer algorithms for polynomial arithmetic [PDF]

, 2011
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for composition of power series, showing that it can be applied practically to ...
Andrew Novocin, Novocin, Andrew, Hart, William, William Hart, Hart, William B.   +4 more
core   +1 more source

Vertex and edge covers with clustering properties: complexity and algorithms [PDF]

, 2009
We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, Henning, Manlove, David F., Fernau, H., Manlove, D.F.   +3 more
core   +1 more source

Compact and Low-Latency FPGA-Based Number Theoretic Transform Architecture for CRYSTALS Kyber Postquantum Cryptography Scheme

Information
In the modern era of the Internet of Things (IoT), especially with the rapid development of quantum computers, the implementation of postquantum cryptography algorithms in numerous terminals allows them to defend against potential future quantum attack ...
Binh Kieu-Do-Nguyen, Nguyen The Binh, Cuong Pham-Quoc, Huynh Phuc Nghi, Ngoc-Thinh Tran, Trong-Thuc Hoang, Cong-Kha Pham   +6 more
doaj   +1 more source

Information-Theoretic Data Discarding for Dynamic Trees on Data Streams

Entropy, 2013
Ubiquitous automated data collection at an unprecedented scale is making available streaming, real-time information flows in a wide variety of settings, transforming both science and industry.
Christoforos Anagnostopoulos, Robert B. Gramacy   +1 more
doaj   +1 more source