Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-25T12:27:03.777Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on Counting Very Different Sequences

Published online by Cambridge University Press:  10 December 2001

EMANUELA FACHINI  and
JÁNOS KÖRNER
EMANUELA FACHINI
Affiliation:
Department of Computer Science, University of Rome I ‘La Sapienza’, Via Salaria 113, 00198 Roma, Italy; (e-mail: fachini@dsi.uniroma1.it, korner@dsi.uniroma1.it)
JÁNOS KÖRNER
Affiliation:
Department of Computer Science, University of Rome I ‘La Sapienza’, Via Salaria 113, 00198 Roma, Italy; (e-mail: fachini@dsi.uniroma1.it, korner@dsi.uniroma1.it)
Get access Rights & Permissions [Opens in a new window]

Abstract

We strengthen the Cohen–Körner–Simonyi upper bound on counting ‘very different sequences’.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 10 , Issue 6 , November 2001 , pp. 501 - 504
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)