Wikipedia:Articles for deletion/NLIN

The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.

The result was keep by snowball clause. Evident consensus that the topic is notable, and the nominator has added a keep !vote, which amounts to withdrawing the nomination. (non-admin closure) ‎ XOR'easter (talk) 17:28, 22 December 2023 (UTC)[reply]

NLIN

[Hide this box] New to Articles for deletion (AfD)? Read these primers!

(Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)

Reviewed during NPP. I can describe this as no indication of wp:notability under GNG or SNG but in a search I found zero, so not even enought to confirm that this exists. It's not even mentioned at the Computational complexity theory article. If it exists, the coverage here (a one sentence definition) could go in that article. North8000 (talk) 18:50, 20 December 2023 (UTC)[reply]

Note: This discussion has been included in the deletion sorting lists for the following topics: Mathematics and Computing. Deltaspace⁴² (talk • contribs) 19:04, 20 December 2023 (UTC)[reply]
Keep. Google Scholar gives some results related to computational complexity. Also, it's not even mentioned at the Computational complexity theory article - as if that article is necessarily complete. See WP:WIP Deltaspace⁴² (talk • contribs) 19:29, 20 December 2023 (UTC)[reply]

The article starts with "in Computational complexity theory". Pointing out that this is contemplating a separate article dedicated to something that is not even mentioned there is a useful point and is not equivalent to me claiming that all articles are to be complete as you imply or me not knowing the obvious reality that Wikipedia articles are a work in progress as your writing "See WP:WIP" implies. North8000 (talk) 20:01, 20 December 2023 (UTC)[reply]

Ah, sorry, I didn't know you thought that the creator meant the actual Wikipedia page when writing "in Computational complexity theory". But I think the creator just meant the theory and then wikilinked it because why not. Deltaspace⁴² (talk • contribs) 20:08, 20 December 2023 (UTC)[reply]

My main concerns were that it is a real topic suitable for future building (and that the term is not just a neologism invented/promoted by one author). Were you able to see if this is the case? Sincerely, North8000 (talk) 20:19, 20 December 2023 (UTC)[reply]

Comment: This (and DLIN) may warrant inclusion on the list of complexity classes. I don't have the expertise to know if any of the entries there already encompass this topic. Reconrabbit (talk|edits) 21:29, 20 December 2023 (UTC)[reply]
- I have now included it in that page, as well as in the page P versus NP problem. Its relation to that problem is the main argument for the interest in NLIN AmirOnWiki (talk) 08:40, 21 December 2023 (UTC)[reply]
Keep. Searching for both the keywords DLIN and NLIN on Google Scholar finds some 170 hits, with the combination of keywords seeminingly eliminating many of the false positives that you would get from only one: most of the results are highly relevant. These are a niche topic in structural complexity (because not robust classes) but notable enough. Leaving the same comment on both AfDs. —David Eppstein (talk) 16:49, 21 December 2023 (UTC)[reply]
Keep Based on what folks have found that I didn't find. North8000 (talk) 17:00, 21 December 2023 (UTC)[reply]

The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.