L'objectiu del grup és la producció de contribucions rellevants en les àrees d'expertesa dels components del grup i la seva disseminació en revistes i conferències internacionals de prestigi reconegut. És voluntat del grup que les contribucions tinguin un impacte significatiu a llarg termini. La transferència de tecnologia és considerada com una conseqüència de l'excel·lència en la recerca i s'ha de portar a terme com un mitjà per incrementar l'impacte dels resultats, obtenir recursos per al grup i explorar nous temes per a la recerca en el futur.
The class of sets decided within polynomial space by machines with polynomial advice, PSPACE/poly, is characterized in several ways. Some PSPACE-complete sets furnish a characterization. Query length in oracle machines, closure of a small class under algebraic operations, parallel straight-line programs, and Kolmogorov complexity are other approaches that allow to characterize the class PSPACE/poly. Some properties of a dual class defined by exponential lower bounds are also shown, as a version of Lupanov theorem and a characterization in terms of oracle Turing machines.
The properties of classes defined by lower bounds on certain measures are considered, along with the `duality' relationship between lower and upper bounds. The need of a formalization of some clear, intuitive facts was apparent and, when worked out, it turned out to require more thought than the authors expected. They found themselves again and again stating `obvious' facts about orders of magnitude which when formalized were false, or at least not completely correct. They present the formalization which they finally achieved in this short note, `in the hope that some other researchers may avoid getting into the same trouble in the future'. One of the intuitively obvious facts which they intended to formalize can be expressed as follows: a function which is experimentally bounded below requires a linearly bounded below amount of bits to be written down