๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of mod-2l sum PLA's

โœ Scribed by Sasao, T.; Besslich, P.

Book ID
119772373
Publisher
IEEE
Year
1990
Tongue
English
Weight
543 KB
Volume
39
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the mod sum number ofHm,n
On the mod sum number ofHm,n
โœ Wenqing Dou ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer US ๐ŸŒ English โš– 338 KB
On the Complexity of Succinct Zero-Sum G
On the Complexity of Succinct Zero-Sum Games
โœ Lance Fortnow; Russell Impagliazzo; Valentine Kabanets; Christopher Umans ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer ๐ŸŒ English โš– 557 KB
The characterization of zero-sum (mod 2)
The characterization of zero-sum (mod 2) bipartite Ramsey numbers
โœ Caro, Yair; Yuster, Raphael ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 134 KB

Let G be a bipartite graph, with k|e(G). The zero-sum bipartite Ramsey number B(G, Z k ) is the smallest integer t such that in every Z k -coloring of the edges of K t,t , there is a zero-sum mod k copy of G in K t,t . In this article we give the first proof that determines B(G, Z 2 ) for all possib