Combinatorial families that are exponentially far from being listable in Gray code sequence (Q4216327): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1090/s0002-9947-99-02229-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1636676699 / rank | |||
Normal rank |
Latest revision as of 09:25, 30 July 2024
scientific article; zbMATH DE number 1214880
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial families that are exponentially far from being listable in Gray code sequence |
scientific article; zbMATH DE number 1214880 |
Statements
Combinatorial families that are exponentially far from being listable in Gray code sequence (English)
0 references
26 October 1998
0 references
Gray code
0 references
nonexistence
0 references
existence problem
0 references
Hamiltonian path problem
0 references
NP-complete
0 references