Deciding Representability of Sets of Words of Equal Length in Polynomial Time (Q2870014): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Francine Blanchet-Sadri / rank | |||
Property / author | |||
Property / author: Francine Blanchet-Sadri / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19: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