Brute force on 10 letters

A tétel rövid nézete
dc.contributor.authorKovács, Zoltán
dc.contributor.authorHudi, István
dc.date.accessioned2024-09-04T09:45:39Z
dc.date.available2024-09-04T09:45:39Z
dc.date.issued2007-06-01
dc.description.abstractWe deal with two problems in the set of 10-character-long strings. Both problems can be solved by slightly different methods, but our approach for each is brute force. As we point out, there can be differences in effectivity even in different brute force algorithms. As an additional result, we answer an open question of Raymond Smullyan's.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 5 No. 1 (2007) , 183-193
dc.identifier.doihttps://doi.org/10.5485/TMCS.2007.0160
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue1
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379604
dc.identifier.volume5
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14794
dc.rights.accessOpen Access
dc.rights.ownerZoltán Kovács and István Hudi
dc.subjectpuzzlesen
dc.subjectbrute forceen
dc.subjectC/C++ languageen
dc.subjectgraph algorithmsen
dc.titleBrute force on 10 lettersen
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
154.95 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)