Your browser does not fully support modern features. Please upgrade for a smoother experience.
Submitted Successfully!
Thank you for your contribution! You can also upload a video entry or images related to this topic. For video creation, please contact our Academic Video Service.
Version Summary Created by Modification Content Size Created at Operation
1 handwiki Vivi Li -- 1427 2022-10-28 01:40:45

Video Upload Options

We provide professional Academic Video Service to translate complex research into visually appealing presentations. Would you like to try it?
No, upload directly Yes
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
HandWiki. Context of Computational Complexity. Encyclopedia. Available online: https://encyclopedia.pub/entry/31723 (accessed on 16 October 2026).
HandWiki. Context of Computational Complexity. Encyclopedia. Available at: https://encyclopedia.pub/entry/31723. Accessed October 16, 2026.
HandWiki. "Context of Computational Complexity" Encyclopedia, https://encyclopedia.pub/entry/31723 (accessed October 16, 2026).
HandWiki. (2022, October 28). Context of Computational Complexity. In Encyclopedia. https://encyclopedia.pub/entry/31723
HandWiki. "Context of Computational Complexity." Encyclopedia. Web. 28 October, 2022.
Context of Computational Complexity
Edit
The content is sourced from: https://handwiki.org/wiki/Context_of_computational_complexity

In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that a machine needs to solve a particular problem. Interpreting these metrics meaningfully requires context, and this context is frequently implicit and depends on the field and the problem under consideration. This article describes a number of important pieces of context and how they affect metrics.

computational complexity analysis algorithms

References

  1. "On the bit complexity of finding points in connected components of a smooth real hypersurface | Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation" (in EN). doi:10.1145/3373207.3404058. https://dl.acm.org/doi/abs/10.1145/3373207.3404058. 
  2. ElliottJesse; SchostÉric (2019-12-17). "Bit complexity for critical point computation in smooth and compact real hypersurfaces" (in EN). ACM Communications in Computer Algebra. doi:10.1145/3377006.3377014. https://dl.acm.org/doi/abs/10.1145/3377006.3377014. 
More
©Text is available under the terms and conditions of the Creative Commons-Attribution ShareAlike (CC BY-SA) license; additional terms may apply. By using this site, you agree to the Terms and Conditions and Privacy Policy.
Upload a video for this entry
Information
Subjects: Others
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register :
HandWiki
View Times: 767
Entry Collection: HandWiki
Revision: 1 time (View History)
Update Date: 28 Oct 2022
Table of Contents
    Notice
    You are not a member of the advisory board for this topic. If you want to update advisory board member profile, please contact office@encyclopedia.pub.
    OK
    Confirm
    Only members of the Encyclopedia advisory board for this topic are allowed to note entries. Would you like to become an advisory board member of the Encyclopedia?
    Yes
    No
    ${ textCharacter }/${ maxCharacter }
    Submit
    Cancel
    There is no comment~
    ${ textCharacter }/${ maxCharacter }
    Submit
    Cancel
    ${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
    Submit
    Cancel
    Confirm
    Are you sure to Delete?
    Yes No
    Academic Video Service
    Feedback