The following pages link to Anna Bernasconi (Q385499):
Displaying 34 items.
- Compact DSOP and partial DSOP forms (Q385501) (← links)
- Synthesis of autosymmetric functions in a new three-level form (Q927395) (← links)
- (Q1124880) (redirect page) (← links)
- How fast can one compute the permanent of circulant matrices? (Q1124882) (← links)
- Spectral properties of some matrices close to the Toeplitz triangular form (Q1323624) (← links)
- The average sensitivity of square-freeness (Q1590081) (← links)
- Room allocation: a polynomial subcase of the quadratic assignment problem (Q1765233) (← links)
- Hilbert function and complexity lower bounds for symmetric Boolean functions (Q1854301) (← links)
- Circuit and decision tree complexity of some number theoretic problems (Q1854439) (← links)
- Complexity of some arithmetic problems for binary polynomials (Q1889852) (← links)
- TOrPEDO : witnessing model correctness with topological proofs (Q2065548) (← links)
- Characterization and computation of ancestors in reaction systems (Q2157013) (← links)
- On the error resilience of ordered binary decision diagrams (Q2354761) (← links)
- Exploiting regularities for Boolean function synthesis (Q2432543) (← links)
- (Q2718887) (← links)
- Using Flexibility in P-Circuits by Boolean Relations (Q2985749) (← links)
- Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults (Q3190146) (← links)
- Exploiting Symmetrization and D-Reducibility for Approximate Logic Synthesis (Q3390205) (← links)
- On formal descriptions for knitting recursive patterns (Q3541196) (← links)
- (Q4218437) (← links)
- (Q4251041) (← links)
- A characterization of bent functions in terms of strongly regular graphs (Q4571343) (← links)
- Spectral analysis of Boolean functions as a graph eigenvalue problem (Q4571396) (← links)
- (Q4583775) (← links)
- On the Average Sensitivity of Testing Square-Free Numbers (Q4938669) (← links)
- (Q4955547) (← links)
- (Q4955548) (← links)
- Integrating Topological Proofs with Model Checking to Instrument Iterative Design (Q5039527) (← links)
- From Model Checking to a Temporal Proof for Partial Models (Q5194652) (← links)
- Boolean Minimization of Projected Sums of Products via Boolean Relations (Q5229021) (← links)
- A NOTE ON THE POLYNOMIAL REPRESENTATION OF BOOLEAN FUNCTIONS OVER GF(2) (Q5249026) (← links)
- Knitting for Fun: A Recursive Sweater (Q5426015) (← links)
- Quantum clustering with \(k\)-means: a hybrid approach (Q6190010) (← links)
- Quantum Networks on Cubelike Graphs (Q6210483) (← links)
