The minimum size required of a solitaire army.
Bell, George I., Hirschberg, Daniel S., Guerrero-García, Pablo (2007)
Integers
Similarity:
Bell, George I., Hirschberg, Daniel S., Guerrero-García, Pablo (2007)
Integers
Similarity:
van de Bult, Fokko J., Gijswijt, Dion C., Linderman, John P., Sloane, N.J.A., Wilks, Allan R. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Schattscheider, Doris (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rasmussen, Shelley L. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nuida, Koji (2010)
Integers
Similarity:
Barequet, Gill, Moffie, Micha, Ribó, Ares, Rote, Günter (2006)
Integers
Similarity:
Konvalinka, Matjaž (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bohman, Tom, Holzman, Ron, Kleitman, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Roby, Tom, Terada, Itaru (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dransfield, Michael R., Liu, Lengning, Marek, Victor W., Truszczyński, Mirosław (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wilf, Herbert S. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mitzenmacher, Michael (2009)
Probability Surveys [electronic only]
Similarity:
Angelova, Vesela, Borissov, Yuri (2013)
Serdica Journal of Computing
Similarity:
We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively...