Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 169
Volume 169, August 2021
- John C. Urschel
, Jake Wellens:
Testing gap k-planarity is NP-complete. 106083 - Ambroise Baril, Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Hardness and tractability of the γ-Complete Subgraph problem. 106105 - Ivy Ordanel, Proceso Fernandez, Henry N. Adorna:
A polynomial time algorithm for the 2-Poset Cover Problem. 106106 - Stefano Bistarelli, Fabio Rossi, Francesco Santini:
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs. 106107 - Ali Mili:
Differentiators and detectors. 106111 - Judith Schilling:
Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings. 106112 - Bartosz Bednarczyk:
Statistical EL is ExpTime-complete. 106113 - Chris R. Giannella:
Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data. 106115
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-29 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
