The future or graphical communication education in the new South Africa.
Pretorius, Johann (1999)
Journal for Geometry and Graphics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Pretorius, Johann (1999)
Journal for Geometry and Graphics
Similarity:
(2020)
Kybernetika
Similarity:
Walter William Rouse Ball
Similarity:
Ján Maňuch (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider the multiparty communication model defined in [4] using the formalism from [8]. First, we correct an inaccuracy in the proof of the fundamental result of [6] providing a lower bound on the nondeterministic communication complexity of a function. Then we construct several very hard functions, , functions such that those as well as their complements have the worst possible nondeterministic communication complexity. The problem to find a particular very hard function...
P.S. BULLEN (1971)
Aequationes mathematicae
Similarity:
A.R. BEDNAREK, A.D. WALLACE (1971)
Aequationes mathematicae
Similarity:
Halina Swiatak (1979)
Aequationes mathematicae
Similarity:
K.P. Chinda (1974)
Aequationes mathematicae
Similarity:
Shigeru Haruki (1979)
Aequationes mathematicae
Similarity: