Live briefing
Everything about APX
Complexity class of approximable problems
In computational complexity theory, the class APX is the set of NP optimization problems that allow polynomial-time approximation algorithms with approximation ratio bounded by a constant. In simple terms, problems in this class have efficient algorithms that can find an answer within some fixed multiplicative factor of the optimal answer. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: APXA 5-minute orientation
- Skim a recent paper: Endophytic Fungal Consortia Enhance Basal Drought-Tolerance in Moringa oleifera by Upregulating the Antioxidant Enzyme (APX) through Heat Shock FactorsInfluential work since 2022
- Pick up a classic book: The elective franchise as it is, and as it ought to beThe most-reprinted book on the subject
- Read the landmark paper: Dual regulation of cytosolic ascorbate peroxidase (APX) by tyrosine nitration andS-nitrosylationCited 328 times
- Go sideways: Polynomial-time approximation schemeA closely related topic
- Go sideways: Approximation algorithmA closely related topic
📖 Definitions
Symbol ISO 639-3 language code for Aputai.
Noun Abbreviation of appendix.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Dual regulation of cytosolic ascorbate peroxidase (APX) by tyrosine nitration andS-nitrosylation
Some APX-completeness results for cubic graphs
Expression of SOD and APX genes positively regulates secondary cell wall biosynthesis and promotes plant growth and yield in Arabidopsis under salt stress
The maternal genes apx-1 and glp-1 and establishment of dorsal-ventral polarity in the early C. elegans embryo
Heat exposure alters the expression of SOD, POD, APX and CAT isozymes and mitigates low cadmium toxicity in seedlings of sensitive and tolerant rice cultivars
Heat shock‐mediated APX gene expression and protection against chilling injury in rice seedlings
ROS generation, oxidative burst and dynamic expression profiles of ROS-scavenging enzymes of superoxide dismutase (SOD), catalase (CAT) and ascorbate peroxidase (APX) in response to Erwinia amylovora in pear (Pyrus communis L)
Pe STZ 1, a C2H2‐type zinc finger transcription factor from Populus euphratica , enhances freezing tolerance through modulation of ROS scavenging by directly regulating Pe APX 2
🆕 Influential since 2022
Endophytic Fungal Consortia Enhance Basal Drought-Tolerance in Moringa oleifera by Upregulating the Antioxidant Enzyme (APX) through Heat Shock Factors
Nitric Oxide (NO) Differentially Modulates the Ascorbate Peroxidase (APX) Isozymes of Sweet Pepper (Capsicum annuum L.) Fruits
Whole-Genome Identification of APX and CAT Gene Families in Cultivated and Wild Soybeans and Their Regulatory Function in Plant Development and Stress Response
Regulation of APX, SOD, and PAL genes by chitosan under salt stress in rapeseed (Brassica napus L.)
Genome-Wide Identification and Analysis of the Ascorbate Peroxidase (APX) Gene Family of Winter Rapeseed (Brassica rapa L.) Under Abiotic Stress
📚 Books worth reading
- 📕The elective franchise as it is, and as it ought to beJames J. Macintyre · 1847
8086-8088, § apx 186-188-286-80386- 📕Organizational maintenance manual · 1989
Practical sanitationReid, George. · 1904- 📕Sketch of the life and character of ... Samuel McCullochDavid Thom · 1853
- 📕Narrative of the proceedings of the deputation to Madrid on behalf of the Spanish prisoners, with an introd. and apx. containing the petitions, etc. [May, 1863]Steane, Edward D.D. · 1864
- 📕Census, taken in July, 1855Providence (R.I.) · 1856
- 📕Cries, in a crisis, for statesmanship popular and patrioticR. A. Macfie · 1881
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Polynomial-time approximation scheme In computer science (particularly algorithmics), a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems…
- Approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems…
- Approximation-preserving reduction In computability theory and computational complexity theory, especially the study of approximation algorithms, an approximation-preserving reduction is…
- Combinatorial optimization Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the…
- MAX-3SAT MAX-3SAT is a problem in the computational complexity subfield of computer science. It generalises the Boolean satisfiability problem (SAT) which is a…
- PTAS reduction In computational complexity theory, a PTAS reduction is an approximation-preserving reduction that is often used to perform reductions between solutions…
- NP-hardness In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time…
- Max/min CSP/Ones classification theorems In computational complexity theory, a branch of computer science, the Max/min CSP/Ones classification theorems state necessary and sufficient conditions…