Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

DCC
2004
IEEE

favoriteEmaildiscussreport

105views Computer Graphics» more DCC 2004»

On Non-Polynomial Latin Squares

14 years 3 months ago

On Non-Polynomial Latin Squares

Download aladin.elf.stuba.sk

A Latin square L = L( ij) over the set S = {0, 1, . . . , n - 1} is called totally non-polynomial over Zn iff

Otokar Grosek, Peter Horák, Tran van Trung

Real-time Traffic

Computer Graphics | DCC 2004 | Latin Square |

claim paper

Related Content

» The Size of the Smallest Strong Critical Set in a Latin Square

» Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges

» Maximal sets of mutually orthogonal Latin squares

» Finding the Smallest Gap between Sums of Square Roots

» A generalization of plexes of Latin squares

» Approximating Latin Square Extensions

» The cycle structure of two rows in a random Latin square

» A Generalisation of Transversals for Latin Squares

» The threeway intersection problem for latin squares

Post Info
More Details (n/a)

Added	25 Dec 2009
Updated	25 Dec 2009
Type	Conference
Year	2004
Where	DCC
Authors	Otokar Grosek, Peter Horák, Tran van Trung

Comments (0)