Sfoglia per Autore  

opzioni
Mostra risultati da 1 a 30 di 117
Titolo Data di pubblicazione Autore(i) File
Measures of Boolean Function Complexity based on Harmonic Analysis 1-gen-1994 Bernasconi, Anna; B., Codenotti
Spectral Properties of Some Matrices Close to the Toeplitz Triangular Form 1-gen-1994 Bernasconi, Anna; M., Leoncini; G., Resta
Sensitivity vs. Block Sensitivity (an average-case study) 1-gen-1996 Bernasconi, Anna
On the Complexity of Balanced Boolean functions 1-gen-1997 Bernasconi, Anna
Computing Groebner Bases in the Boolean Setting with Applications to Counting 1-gen-1997 Bernasconi, Anna; B., Codenotti; V., Crespi; G., Resta
ON THE POLYNOMIAL REPRESENTATION OF BOOLEAN FUNCTIONS OVER GF(2) 1-gen-1998 Bernasconi, Anna
Mathematical Techniques for the Analysis of Boolean Functions 1-gen-1998 Bernasconi, Anna
Introduzione alla Complessità Computazionale 1-gen-1998 Bernasconi, Anna; B., Codenotti
Harmonic Analysis and Boolean Function Complexity 1-gen-1998 Bernasconi, Anna
COMBINATORIAL PROPERTIES OF CLASSES OF FUNCTIONS HARD TO COMPUTE IN CONSTANT DEPTH 1-gen-1998 Bernasconi, Anna
On Boolean Functions Satisfying Odd Order Propagation Criteria 1-gen-1998 Bernasconi, Anna
Metodi Matematici in Complessità Computazionale 1-gen-1999 Bernasconi, Anna; B., Codenotti; G., Resta
A Note on the Polynomial Representation of Boolean Functions over GF(2) 1-gen-1999 R., Beigel; Bernasconi, Anna
On the Complexity of Balanced Boolean functions 1-gen-1999 Bernasconi, Anna
How fast can one compute the permanent of circulant matrices? 1-gen-1999 Bernasconi, Anna; B., Codenotti; V., Crespi; G., Resta
Hilbert function and complexity lower bounds for symmetric Boolean functions 1-gen-1999 Bernasconi, Anna; L., Egidi
Circuit Complexity of Testing Square-Free Numbers 1-gen-1999 Bernasconi, Anna; I., Shparlinski
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem 1-gen-1999 Bernasconi, Anna; B., Codenotti
On the Average Sensitivity of Testing Square-free numbers 1-gen-1999 Bernasconi, Anna; C., Damm; I., Shparlinski
On Boolean Functions associated to Bipartite Cayley Graphs 1-gen-2000 Bernasconi, Anna; B., Codenotti
The Average Sensitivity of Square-Freeness 1-gen-2000 Bernasconi, Anna; C., Damm; I., Shparlinski
On a hierarchy of Boolean functions hard to compute in constant depth 1-gen-2001 Bernasconi, Anna
Efficient Optimal Greedy Algorithms for Room Allocation 1-gen-2001 V., Ciriani; Pisanti, Nadia; Bernasconi, Anna
A CHARACTERIZATION OF BENT FUNCTIONS IN TERMS OF STRONGLY REGULAR GRAPHS 1-gen-2001 Bernasconi, Anna; B., Codenotti; J. M., Vanderkam
Circuit and Decision Tree Complexity of Some Number Theoretic Problems 1-gen-2001 Bernasconi, Anna; C., Damm; I., Shparlinski
Fast Three-Level Logic Minimization Based on Autosymmetry 1-gen-2002 Bernasconi, Anna; Ciriani, V.; Luccio, Fabrizio; Pagli, Linda
2-SPP: a practical trade-off between SP and SPP synthesis 1-gen-2002 V., Ciriani; Bernasconi, Anna
Implicit Test of Regularity for Incompletely Specified Boolean Functions 1-gen-2002 Bernasconi, Anna; V., Ciriani; F., Luccio; Pagli, Linda
Fast Three-Level Logic Minimization Based on Autosimmetry 1-gen-2002 Bernasconi, Anna; Ciriani, V; Luccio, Fabrizio; Pagli, Linda
Complexity of some arithmetic problems for binary polynomials 1-gen-2003 E., Allender; Bernasconi, Anna; C., Damm; J., VON ZUR GATHEN; M., Saks; I., Shparlinski
Mostra risultati da 1 a 30 di 117
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile