Imagen de Portada

MCAC: A Model Counting Algorithm for Exact Computation of Error Metrics of Approximate Circuits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ramprasath, S, Siddharthan, Sibi, Charan, Marrivada Gopala Krishna Sai, Vasudevan, Vinita
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
por: Li, Jinzhao, et al.
Publicado: (2025)

Simulating Quantum Circuits by Model Counting
por: Mei, Jingyi, et al.
Publicado: (2024)

Formally Certified Approximate Model Counting
por: Tan, Yong Kiam, et al.
Publicado: (2024)

Towards Verifying Exact Conditions for Implementations of Density Functional Approximations
por: Helal, Sameerah, et al.
Publicado: (2024)

Modular Counting CSP: Reductions and Algorithms
por: Kazeminia, Amirhossein, et al.
Publicado: (2025)

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts
por: Cate, Balder ten, et al.
Publicado: (2025)

An Imperative Language for Verified Exact Real-Number Computation
por: Bauer, Andrej, et al.
Publicado: (2024)

Approximate SMT Counting Beyond Discrete Domains
por: Shaw, Arijit, et al.
Publicado: (2025)

Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
por: Boreale, Michele, et al.
Publicado: (2019)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
por: Lichter, Moritz
Publicado: (2022)

Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat
por: Tóth, Jan, et al.
Publicado: (2024)

On Lower Bounding Minimal Model Count
por: Kabir, Mohimenul, et al.
Publicado: (2024)

Algorithmic Problems for Computation Trees
por: Moshkov, Mikhail
Publicado: (2025)

Minimal Model Counting via Knowledge Compilation
por: Kabir, Mohimenul
Publicado: (2024)

On Top-Down Pseudo-Boolean Model Counting
por: Yang, Suwei, et al.
Publicado: (2025)

Computing Witnesses Using the SCAN Algorithm
por: Achammer, Fabian, et al.
Publicado: (2026)

On the Metric Temporal Logic for Continuous Stochastic Processes
por: Ikeda, Mitsumasa, et al.
Publicado: (2023)

On the Completeness of Interpolation Algorithms
por: Hetzl, Stefan, et al.
Publicado: (2024)

Computing Witnesses Using the SCAN Algorithm (Extended Preprint)
por: Achammer, Fabian, et al.
Publicado: (2025)

When Do You Start Counting? Revisiting Counting and Pnueli Modalities in Timed Logics
por: Ho, Hsi-Ming, et al.
Publicado: (2024)

Model Counting in the Wild
por: Shaw, Arijit, et al.
Publicado: (2024)

Bridging Computational Notions of Depth
por: Bienvenu, Laurent, et al.
Publicado: (2024)

Model Counting for Dependency Quantified Boolean Formulas
por: Fung, Long-Hin, et al.
Publicado: (2025)

Dynamic Probability Logic: Decidability & Computability
por: Chopoghloo, Somayeh, et al.
Publicado: (2024)

Fixed Point Theorems in Computability Theory
por: Terwijn, Sebastiaan A.
Publicado: (2024)

Coalgebraic Behavioral Metrics
por: Baldan, Paolo, et al.
Publicado: (2017)

Computing with Infinite Objects: the Gray Code Case
por: Spreen, Dieter, et al.
Publicado: (2021)

Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
por: De Domenico, Andrea, et al.
Publicado: (2024)

Simplifier: A New Tool for Boolean Circuit Simplification
por: Averkov, Daniil, et al.
Publicado: (2025)

Exact Exploration
por: Blass, Andreas, et al.
Publicado: (2024)

A Game for Counting Logic Formula Size and an Application to Linear Orders
por: Fournier, Gregoire, et al.
Publicado: (2025)

Queries With Exact Truth Values in Paraconsistent Description Logics
por: Bienvenu, Meghyn, et al.
Publicado: (2024)

A Spectrum of Approximate Probabilistic Bisimulations
por: Spork, Timm, et al.
Publicado: (2024)

Compositional Control-Driven Boolean Circuits
por: Arellanes, Damian
Publicado: (2025)

Towards Counting Markov Equivalence Classes with Logical Constraints
por: Bizzaro, Davide, et al.
Publicado: (2024)

Modular Counting over 3-Element and Conservative Domains
por: Bulatov, Andrei A., et al.
Publicado: (2025)

Inapproximability of Unique Games in Fixed-Point Logic with Counting
por: Tucker-Foltz, Jamie
Publicado: (2021)

Optimal Circuit Synthesis of Linear Codes for Error Detection and Correction
por: Yang, Xi, et al.
Publicado: (2026)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

On The Metric Nature of (Differential) Logical Relations
por: Lago, Ugo Dal, et al.
Publicado: (2025)