Wikipedia:Articles for deletion/DLIN

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:27, 22 December 2023 (UTC)[reply]

DLIN

[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. Usage in academic sources. Entirely about DLIN: [1] [2]. [3] [4] Mentions: [5] [6] A412 (Talk • C) 19:12, 20 December 2023 (UTC)[reply]
Keep per the good sources found by A412. --{{u|Mark viking}} {Talk} 21:57, 20 December 2023 (UTC)[reply]
Keep per the sources above, and in general its relevance to the P versus NP problem. I have added references in the List of complexity classes and in P versus NP problem. AmirOnWiki (talk) 08:32, 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:02, 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.