Anna Bernasconi

Available identifiers

zbMath Open bernasconi.annaMaRDI QIDQ385499

List of research outcomes

Publication	Date of Publication	Type
Quantum clustering with \(k\)-means: a hybrid approach	2024-03-05	Paper
Literal Selection in Switching Lattice Design	2024-01-23	Paper
Computing preimages and ancestors in reaction systems	2023-10-16	Paper
Integrating Topological Proofs with Model Checking to Instrument Iterative Design	2022-10-13	Paper
Characterization and computation of ancestors in reaction systems	2022-07-21	Paper
Exploiting Symmetrization and D-Reducibility for Approximate Logic Synthesis	2022-03-24	Paper
TOrPEDO : witnessing model correctness with topological proofs	2022-01-11	Paper
From Model Checking to a Temporal Proof for Partial Models	2019-09-16	Paper
Boolean Minimization of Projected Sums of Products via Boolean Relations	2019-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4583775	2018-09-03	Paper
A characterization of bent functions in terms of strongly regular graphs	2018-07-09	Paper
Spectral analysis of Boolean functions as a graph eigenvalue problem	2018-07-09	Paper
Using Flexibility in P-Circuits by Boolean Relations	2017-05-16	Paper
On the error resilience of ordered binary decision diagrams	2015-07-24	Paper
A NOTE ON THE POLYNOMIAL REPRESENTATION OF BOOLEAN FUNCTIONS OVER GF(2)	2015-04-29	Paper
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults	2014-09-15	Paper
Compact DSOP and partial DSOP forms	2013-12-02	Paper
On formal descriptions for knitting recursive patterns	2008-11-25	Paper
Quantum Networks on Cubelike Graphs	2008-08-04	Paper
Synthesis of autosymmetric functions in a new three-level form	2008-06-06	Paper
Knitting for Fun: A Recursive Sweater	2007-11-15	Paper
Exploiting regularities for Boolean function synthesis	2006-10-25	Paper
Room allocation: a polynomial subcase of the quadratic assignment problem	2005-02-23	Paper
Complexity of some arithmetic problems for binary polynomials	2004-12-13	Paper
The average sensitivity of square-freeness	2003-06-09	Paper
Hilbert function and complexity lower bounds for symmetric Boolean functions	2003-01-14	Paper
Circuit and decision tree complexity of some number theoretic problems	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q2718887	2001-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q4955547	2000-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q4955548	2000-05-28	Paper
On the Average Sensitivity of Testing Square-Free Numbers	2000-04-03	Paper
How fast can one compute the permanent of circulant matrices?	1999-11-29	Paper
https://portal.mardi4nfdi.de/entity/Q4251041	1999-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4218437	1998-11-11	Paper
Spectral properties of some matrices close to the Toeplitz triangular form	1994-11-17	Paper

Research outcomes over time

This page was built for person: Anna Bernasconi