Results 241 to 250 of about 5,154 (256)
Some of the next articles are maybe not open access.
Intersection Classes in TFNP and Proof Complexity
Information Technology Convergence and ServicesA recent breakthrough in the theory of total NP search problems (TFNP) by Fearnley, Goldberg, Hollender, and Savani has shown that CLS = PLS ∩ PPAD , or, in other words, the class of problems reducible to gradient descent are exactly those problems in ...
Yuhao Li, William Pires, Robert Robere
semanticscholar +1 more source
Total NP Search Problems with Abundant Solutions
Information Technology Convergence and ServicesWe define a new complexity class TFAP to capture TFNP problems that possess abundant solutions for each input. We identify several problems across diverse fields that belong to TFAP , including WeakPigeon (finding a collision in a mapping from [2 n ...
Jiawei Li
semanticscholar +1 more source
Journal of Pharmacology and Experimental Therapeutics, 2000
D. Shehnaz+3 more
semanticscholar +1 more source
D. Shehnaz+3 more
semanticscholar +1 more source
Effect of PPADS on achondroplasic chondrocytes: inhibition of FGF receptor type 3 over-activity.
European Journal of Pharmacology, 2008A. Guzman-Aranguez+3 more
semanticscholar +1 more source