ARTÍCULO
TITULO

A Complete Characterization of the Algebras of Minimal Bilinear Complexity

Markus Bläser     

Resumen

No disponible

 Artículos similares

       
 
Valerio Biancalana and Piero Chessa    
We analyze the information that can be retrieved from the tracking parameters produced by an innovative wearable eye tracker. The latter is based on a permanent-magnet marked corneal lens and by an array of magnetoresistive detectors that measure the mag... ver más
Revista: Instruments

 
Ioana Demetrescu, Radu Nartita, Mihai Andrei, Andreea Cristiana Didilescu, Anisoara Cimpean and Daniela Ionita    
Amidst the prevalence of aggressive bacterial infections that can impact both oral and systemic health following various dental and implant procedures, the search for alternative, high-performing and biocompatible materials has become a challenging pursu... ver más
Revista: Applied Sciences

 
Kevinstiv Castro Huaman, Yaneth Vasquez Olivera, Vidal Aramburu Rojas, Luis Arauzo, Carlos Raymundo Ibañez and Francisco Dominguez    
The necessity of mining valuable metals must be balanced with the safe and effective disposal or remediation of the resulting waste. Water, one of our most valuable resources, is a major component of the mining process, and its post-operation storage oft... ver más
Revista: Water

 
Edoardo Mancini, Lorenzo Mussolin, Giulia Morettini, Massimiliano Palmieri, Maria Ionica, Gianluigi Silvestre, Franck Cadoux, Agnese Staffa, Giovanni Ambrosi, Filippo Cianetti, Claudio Braccesi, Lucio Farnesini, Mirco Caprai, Gianluca Scolieri, Roberto Petrucci and Luigi Torre    
Physics research is constantly pursuing more efficient silicon detectors, often trying to develop complex and optimized geometries, thus leading to non-trivial engineering challenges. Although critical for this optimization, there are few silicon tile me... ver más
Revista: Instruments

 
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe and Nicola Santoro    
Consider a set of k identical asynchronous mobile agents located in an anonymous ring of n nodes. The classical Gather (or Rendezvous) problem requires all agents to meet at the same node, not a priori decided, within a finite amount of time. This proble... ver más
Revista: Algorithms