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). We unify,…”
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

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

“…Betweenness centrality (BC) is a crucial graph problem that measures the significance of a vertex by the number of shortest paths leading through it. We…”
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. Most of the classic DIMACS…”
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…”
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

“…Algebraic multigrid (AMG) methods are particularly efficient to solve a wide range of sparse linear systems, due to their good flexibility and adaptability…”
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

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…”
Get full text

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

“…We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as Controlled-Square-Root-of-Not (i.e. Controlled-V)…”
Get full text

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

“…It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective…”
Get full text

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

“…Bacterial Vaginosis (BV) is the most common of vaginal infections diagnosed among women during the years where they can bear children. Yet, there is very…”
Get more information

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

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

On the unification of query algebras and their extension to rational tree structures by Schewe, Klaus-Dieter

“…In order to come to a unification of existing query algebras, especially for object bases, it is necessary to understand the semantic differences between…”
Get full text

Surface representations using blossoms and buds by Yohanes, S.L.

“…Shape representations using polynomials in computer-aided geometric design (CAGD) and computer graphics are ubiquitous. This paper shows that any bivariate…”
Get full text

Computer algebra and desuspensions of stunted real projective spaces by Nakos, George, Glinos, Nikolaos

“…In this work we apply computer algebra methods to partially solve a geometric problem which arises in algebraic topology. This is related to a particularly…”
Get full text