Finding Compact Scheme Forests in Nested Normal Form is NP-Hard

Peter Thanisch, George Loizou, Jyrki Nummenmaa

Research output: Contribution to journal › Article › Scientific › peer-review

Original language	English
Pages (from-to)	19-41
Journal	Information and Computation
Volume	110
Issue number	1
Publication status	Published - 1994
Publication type	A1 Journal article-refereed

Cite this

@article{f40af7ba422d4dc2a0c21fb556222f2a,

title = "Finding Compact Scheme Forests in Nested Normal Form is NP-Hard",

author = "Peter Thanisch and George Loizou and Jyrki Nummenmaa",

year = "1994",

language = "English",

volume = "110",

pages = "19--41",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

number = "1",

}