Search Results - algorithms—algebraic algorithms

Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling by Soos, Mate, Meel, Kuldeep S.

“…Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent…”
Get full text

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP by Barto, Libor, Brady, Zarathustra, Bulatov, Andrei, Kozik, Marcin, Zhuk, Dmitriy

“…This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP…”
Get full text

First-Order Reasoning and Efficient Semi-Algebraic Proofs by Part, Fedor, Thapen, Neil, Tzameret, Iddo

“…Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3…”
Get full text

Constraint Satisfaction Problems over Finite Structures by Barto, Libor, DeMeo, William, Mottet, Antoine

“…We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both…”
Get full text

Accelerated Visualization of Dynamic Molecular Surfaces by Lindow, Norbert, Baum, Daniel, Prohaska, Steffen, Hege, Hans-Christian

“… First, we adopt a parallel approximate Voronoi diagram algorithm to compute the MSS. This accelerates the MSS computation by more than one order of magnitude…”
Get full text

Measurable Spaces and Their Effect Logic by Jacobs, Bart

“…So-called effect algebras and modules are basic mathematical structures that were first identified in mathematical physics, for the study of quantum logic and…”
Get full text

Scaling betweenness centrality using communication-efficient sparse matrix multiplication by Solomonik, Edgar, Besta, Maciej, Vella, Flavio, Hoefler, Torsten

“… through it. We propose Maximal Frontier Betweenness Centrality (MFBC): a succinct BC algorithm based on novel sparse matrix multiplication routines that performs a factor…”
Get full text

AmgT: Algebraic Multigrid Solver on Tensor Cores by Lu, Yuechen, Zeng, Lijie, Wang, Tengcheng, Fu, Xu, Li, Wenxuan, Cheng, Helin, Yang, Dechuang, Jin, Zhou, Casas, Marc, Liu, Weifeng

“… This paper proposes AmgT, a new AMG solver that utilizes the tensor core and mixed precision ability of the latest GPUs during multiple phases of the AMG algorithm…”
Get full text

Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations by Izmaylov, Artur F, Lang, Robert A, Yen, Tzu-Ching

“…Optimization of unitary transformations in Variational Quantum Algorithms benefits highly from efficient evaluation of cost function gradients with respect to amplitudes of unitary generators…”
Get full text

Division-free computation of subresultants using Bezout matrices by Kerber, Michael

“…We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm given by Abdeljaoued et al. [J. Abdeljaoued, G. Diaz-Toca, and L…”
Get full text

Solving difficult SAT instances in the presence of symmetry by Aloul, Fadi A., Ramani, Arathi, Markov, Igor L., Sakallah, Karem A.

“…Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts…”
Get full text

STM-Multifrontal QR: Streaming Task Mapping Multifrontal QR Factorization Empowered by GCN by Lin, Shengle, Yang, Wangdong, Wang, Haotian, Tsai, Qinyun, Li, Kenli

“…Multifrontal QR algorithm, which consists of symbolic analysis and numerical factorization, is a high-performance algorithm for orthogonal factorizing sparse matrix…”
Get full text

Computing semi-algebraic invariants for polynomial dynamical systems by Liu, Jiang, Zhan, Naijun, Zhao, Hengjun

“…In this paper, we consider an extended concept of invariant for polynomial dynamical systems (PDSs) with domain and initial condition, and establish a sound…”
Get full text

A Faster Counterexample Minimization Algorithm Based on Refutation Analysis by Shen, ShengYu, Qin, Ying, Li, SiKun

“… The BFL algorithm is the most effective counterexample minimization algorithm compared to all other…”
Get full text

Detecting Bacterial Vaginosis Using Machine Learning by Baker, Yolanda S, Agrawal, Rajeev, Foster, James A, Beck, Daniel, Dozier, Gerry

“… The purpose of this paper is two-fold; first to discover the most significant features necessary to diagnose the infection, second is to apply various classification algorithms on the selected features…”
Get more information

A Novel Unified Architecture for Public-Key Cryptography by Cilardo, A., Mazzeo, A., Mazzocca, N., Romano, L.

“…In this paper we propose a fully-parallel, bit-sliced unified architecture designed to perform modular multipication/exponentiation and GF(2^M) multiplication…”
Get full text

Exact Synthesis of 3-Qubit Quantum Circuits from Non-Binary Quantum Gates Using Multiple-Valued Logic and Group Theory by Yang, Guowu, Hung, William N. N., Song, Xiaoyu, Perkowski, Marek

“… Assuming a cost of one for each two-qubit gate, we found all reversible circuits with quantum costs of 4, 5, 6, etc, and give another algorithm to realize…”
Get full text

Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition by Martinelli, Andres, Dubrova, Elena

“…This paper addresses two problems related to disjoint-support decomposition of Boolean functions. First, we present a heuristic for finding a subset of…”
Get full text

The Euler–Lagrange theory for Schur's Algorithm: Algebraic exposed points by Khrushchev, S.

“…In this paper the ideas of Algebraic Number Theory are applied to the Theory of Orthogonal polynomials for algebraic measures. The transferring tool are Wall…”
Get full text

Distributed consensus and linear functional calculation in networks: an observability perspective by Sundaram, Shreyas, Hadjicostis, Christoforos N.

“…We study the problem of performing sensor fusion and distributed consensus in networks, where the objective is to calculate some linear function of the initial…”
Get full text