Tradeoff Theorems

Tradeoff Theorems is a theoretical construct in structural complexity that characterizes the inherent limitations and quantitative relationships between competing computational resources, such as time, space, and circuit size, thereby establishing rigorous lower bounds on the efficiency of algorithms and computational models.

22

Publications

15K

Citations

49

Authors

37

Institutions

Publications per year

2017–2026

7

Authors

49

  1. CT
    Chao Tian

    AT&T (United States), United States

    2 publications · 117 citations

    2

    h-index

  2. HS
    Hamid Sabourian

    University of Cambridge, United Kingdom

    1 publications · 28 citations

    1

    h-index

  3. OS
    Ofer Shayevitz

    Tel Aviv University, Israel

    1 publications · 11 citations

    1

    h-index

  4. ZW
    Zhiying Wang

    National University of Defense Technology, China

    1 publications · 14 citations

    1

    h-index

  5. VI
    Vincent Iehlé

    Universitat Autònoma de Barcelona, Spain

    1 publications · 28 citations

    1

    h-index

1–5 of 49

Venues

  1. Journal of Economic Theory

    JET · 2 publications · 39 citations

    2

    h-index

  2. IEEE Transactions on Information Theory

    2 publications · 221 citations

    2

    h-index

  3. Information and Control

    1 publications · 42 citations

    1

    h-index

  4. Journal of Systems and Software

    JSS · 1 publications · 18 citations

    1

    h-index

  5. SIAM Journal on Computing

    1 publications · 98 citations

    1

    h-index

1–5