The complexity of regex crosswords (Q2672653): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Complexity of regex crosswords / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP is as easy as detecting unique solutions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The undecidability of the domino problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank |
Latest revision as of 06:47, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of regex crosswords |
scientific article |
Statements
The complexity of regex crosswords (English)
0 references
13 June 2022
0 references
complexity
0 references
regular expression
0 references
regex crossword
0 references
picture language
0 references
NP-completeness
0 references
PSPACE-completeness
0 references