Deciding Representability of Sets of Words of Equal Length in Polynomial Time (Q2870014): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2253769010 / rank | |||
Normal rank | |||
Latest revision as of 18:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding Representability of Sets of Words of Equal Length in Polynomial Time |
scientific article |
Statements
Deciding Representability of Sets of Words of Equal Length in Polynomial Time (English)
0 references
17 January 2014
0 references
