2019
DOI: 10.48550/arxiv.1911.01155
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Learning based Methods for Code Runtime Complexity Prediction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…predicting computing time of dataset with different depth of coverage, read length and assembly complexity. 79 , 86 , 87 While acknowledging this consideration, it is important to note that conducting a benchmark on real machines provides practical insights and actionable data on a specific use case, despite potential confounders introduced by the machine itself or from software virtualization.…”
Section: Discussionmentioning
confidence: 99%
“…predicting computing time of dataset with different depth of coverage, read length and assembly complexity. 79 , 86 , 87 While acknowledging this consideration, it is important to note that conducting a benchmark on real machines provides practical insights and actionable data on a specific use case, despite potential confounders introduced by the machine itself or from software virtualization.…”
Section: Discussionmentioning
confidence: 99%