Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Order 11 (1994), S. 343-351 
    ISSN: 1572-9273
    Keywords: 06A07 ; 68R10 ; Ordered set ; chain partition ; computational complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Lete be a fixed family of chains, i.e.e $$ \subseteq \{ \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{1} ,\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{2} ,\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{3} ,...\} $$ . Ae-partition of an ordered setP=(X, ⩽) is a partition ofX into subsets inducing chains isomorphic to the members ofe. In this paper we classify according to the computational complexity problems of existence of ae-partition ofP.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...