Suchergebnisse - Algorithms-algebraic algorithms*
-
1
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra
ISBN: 1475726953, 9781475726954, 9780387946801, 0387946802Veröffentlicht: New York, NY Springer New York 1996“… Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions …”
Volltext
E-Book -
2
Algebraic algorithms for a class of Schrödinger equations in split quaternionic mechanics
ISSN: 0170-4214, 1099-1476Veröffentlicht: Freiburg Wiley Subscription Services, Inc 15.05.2024Veröffentlicht in Mathematical methods in the applied sciences (15.05.2024)“… In this paper, we study the least squares approximation of a class of Schrödinger equations in split quaternionic mechanics and propose two algebraic algorithms to the generalized right eigen‐problem for an i …”
Volltext
Journal Article -
3
Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling
ISSN: 1558-2434Veröffentlicht: ACM 29.10.2022Veröffentlicht in 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) (29.10.2022)“… 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 …”
Volltext
Tagungsbericht -
4
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra
ISBN: 9781475726930, 1475726937Veröffentlicht: Netherlands Springer Nature 2013Volltext
E-Book -
5
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP …”
Volltext
Tagungsbericht -
6
Computational algebraic algorithms for the reliability of generalized k-out-of- n and related systems
ISSN: 0378-4754, 1872-7166Veröffentlicht: Elsevier B.V 01.09.2011Veröffentlicht in Mathematics and computers in simulation (01.09.2011)“… Identities and bounds for the reliability of coherent systems are analysed and computed using the techniques of commutative algebra. The techniques are applied …”
Volltext
Journal Article -
7
First-Order Reasoning and Efficient Semi-Algebraic Proofs
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… 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 …”
Volltext
Tagungsbericht -
8
A Logic for Locally Complete Abstract Interpretations
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… We introduce the notion of local completeness in abstract interpretation and define a logic for proving both the correctness and incorrectness of some program …”
Volltext
Tagungsbericht -
9
A Comprehensive Review of Solving Selective Harmonic Elimination Problem With Algebraic Algorithms
ISSN: 0885-8993, 1941-0107Veröffentlicht: New York IEEE 01.01.2024Veröffentlicht in IEEE transactions on power electronics (01.01.2024)“… ) equations, which are composed of some nonlinear transcendental equations. Over the past few decades, algebraic algorithms have shown a considerable ability to solve SHE equations, specifically for obtaining all exact solutions …”
Volltext
Journal Article -
10
Constraint Satisfaction Problems over Finite Structures
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both …”
Volltext
Tagungsbericht -
11
Reliability-Based Forward Recursive Algorithms for Algebraic Soft-Decision Decoding of Reed--Solomon Codes
ISSN: 0090-6778, 1558-0857Veröffentlicht: New York, NY IEEE 01.07.2007Veröffentlicht in IEEE transactions on communications (01.07.2007)“… We propose efficient forward recursive algorithms for algebraic soft-decision list decoding of Reed-Solomon codes, which utilize channel reliability information, and outperform the Koetter-Vardy (KV …”
Volltext
Journal Article -
12
Leveraging Critical Proof Obligations for Efficient IC3 Verification
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… IC3 and its variants are SAT-based model-checking methods that play a critical role in hardware verification. Efficient management of proof obligations, which …”
Volltext
Tagungsbericht -
13
QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning
ISSN: 1558-1225Veröffentlicht: IEEE 26.04.2025Veröffentlicht in Proceedings / International Conference on Software Engineering (26.04.2025)“… Formal verification is a promising method for producing reliable software, but the difficulty of manually writing verification proofs severely limits its …”
Volltext
Tagungsbericht -
14
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In …”
Volltext
Tagungsbericht -
15
CoqPilot, a plugin for LLM-based generation of proofs
ISSN: 2643-1572Veröffentlicht: ACM 27.10.2024Veröffentlicht in IEEE/ACM International Conference on Automated Software Engineering : [proceedings] (27.10.2024)“… We present CoqPilot, a VS Code extension designed to help automate writing of Coq proofs. The plugin collects the parts of proofs marked with the admit tactic …”
Volltext
Tagungsbericht -
16
Algebraic algorithms for eigen-problems of a reduced biquaternion matrix and applications
ISSN: 0096-3003Veröffentlicht: Elsevier Inc 15.02.2024Veröffentlicht in Applied mathematics and computation (15.02.2024)“… This paper studies eigen-problems of reduced biquaternion matrices by means of a complex representation of a reduced biquaternion matrix and derives new algebraic algorithms to find the eigenvalues …”
Volltext
Journal Article -
17
Learning-Aided Safe Controller Synthesis with Formal Guarantees via Vector Barrier Certificates
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… The design of controllers for safety-critical systems is an important research issue. Especially, the generation of controllers with formal safety guarantees …”
Volltext
Tagungsbericht -
18
Pipirima: Predicting Patterns in Sparsity to Accelerate Matrix Algebra
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… While sparsity, a feature of data in many applications, provides optimization opportunities such as reducing unnecessary computations, data transfers, and …”
Volltext
Tagungsbericht -
19
ReSMiPS: A ReRAM-based Sparse Mixed-precision Solver with Fast Matrix Reordering Algorithm
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… The solution of sparse matrix equations is essential in scientific computing. However, traditional solvers on digital computing platforms are limited by memory …”
Volltext
Tagungsbericht -
20
AI-Assisted Autoformalization of Combinatorics Problems in Proof Assistants
ISSN: 2832-7632Veröffentlicht: IEEE 27.04.2025Veröffentlicht in IEEE/ACM International Conference on Software Engineering: New Ideas and Emerging Technologies Results (Online) (27.04.2025)“… Proof assistants such as Coq and LEAN have been increasingly used by renowned mathematicians to formalize and prove mathematical theorems. Despite their …”
Volltext
Tagungsbericht

