blog

  • 홈
  • 태그

Programming 31

시간 복잡도 정의 + Pseudo polynomial time complexity

https://stackoverflow.com/questions/19647658/what-is-pseudopolynomial-time-how-does-it-differ-from-polynomial-time/19647659 What is pseudopolynomial time? How does it differ from polynomial time? What is pseudopolynomial time? How does it differ from polynomial time? Some algorithms that run in pseudopolynomial time have runtimes like O(nW) (for the 0/1 Knapsack Problem) or O(√n) (for... stackov..

Programming/Note 2019.12.11
1 2 3 4
더보기
  • 분류 전체보기
    • Computer Science
      • Computer System
      • OS
      • Network
      • Database
      • Algorithms
      • ETC
    • Programming
      • C++
      • JavaScript
      • Note
    • DevOps
      • Container
    • Problem Solving
    • Note
      • Projects
    • Clipping

Tag

C, kmp, 순열, BOJ, ps, 컴퓨터구조, c++, 컴구논, Algorithms, 멘토링, 책정리,

최근글과 인기글

  • 최근글
  • 인기글

Archives

Calendar

«   2025/09   »
일 월 화 수 목 금 토
1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30

방문자수Total

  • Today :
  • Yesterday :

Copyright © Kakao Corp. All rights reserved.

티스토리툴바