Construction of very hard functions for multiparty communication complexity
Ján Maňuch (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Ján Maňuch (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Juraj Hromkovič (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Šćepanović, R.L. (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Ian Stares (1995)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We provide a characterisation of monotone normality with an analogue of the Tietze-Urysohn theorem for monotonically normal spaces as well as answer a question due to San-ou concerning the extension of Urysohn functions in monotonically normal spaces. We also extend a result of van Douwen, giving a characterisation of -spaces in terms of semi-continuous functions, as well as answer another question of San-ou concerning semi-continuous Urysohn functions.
A. Y. Garnaev (2006)
Banach Center Publications
Similarity:
The main purpose of this paper is to analyze a development of a scenario suggested by Baston and Garnaev (2005) for modelling the situation where two departments in a large organization are each seeking to make an appointment within the same area of expertise, for instance, a computer science specialist. The departments are interested in three skills of the candidate (say, writing code, communication and in algorithms). In our scenario Department 1 wants to employ a candidate with excellent...
V. Dičiūnas (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Kvinikadze, G. (1999)
Memoirs on Differential Equations and Mathematical Physics
Similarity:
Lj. Kočinac (1991)
Matematički Vesnik
Similarity: