Towards a unified complexity theory of total functions
The class TFNP, of NP search problems where all instances have solutions, appears not to have complete problems. However, TFNP contains various syntactic subclasses and important problems. We introduce a syntactic class of problems that contains these known subclasses, for the purpose of understandi...
Main Authors: | Goldberg, P, Papadimitriou, C |
---|---|
Format: | Journal article |
Published: |
Elsevier
2017
|
Similar Items
-
Towards a unified complexity theory of total functions
by: Goldberg, P, et al.
Published: (2018) -
Towards a unifying theory of linguistic meaning
by: Prakash Mondal
Published: (2023-12-01) -
Towards a Unified Theory of Learning and Information
by: Ibrahim Alabdulmohsin
Published: (2020-04-01) -
Writing With Pictures: Toward a Unifying Theory of Consumer Response to Visuals
by: Scott, L, et al.
Published: (2007) -
Towards a unified theory of correlations in recurrent neural networks
by: Tetzlaff Tom, et al.
Published: (2011-07-01)