Pages that link to "Item:Q4085242"

The following pages link to On the Structure of Polynomial Time Reducibility (Q4085242):

Displaying 50 items.

• Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
• Uniformly hard languages. (Q1874273) (← links)
• The complexity of minimal satisfiability problems (Q1887137) (← links)
• The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
• Lewis dichotomies in many-valued logics (Q1935553) (← links)
• A note on non-complete problems in \(NP_\mathbb{R}\) (Q1977151) (← links)
• The complexity of tropical graph homomorphisms (Q2012054) (← links)
• Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
• ASNP: a tame fragment of existential second-order logic (Q2106601) (← links)
• Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
• Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
• \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems (Q2228416) (← links)
• The \(C_{k}\)-extended graft construction (Q2275937) (← links)
• On computational complexity and honest polynomial degrees (Q2277252) (← links)
• Weak completeness notions for exponential time (Q2322715) (← links)
• The hidden subgroup problem and MKTP (Q2330111) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• A complexity theory for feasible closure properties (Q2366687) (← links)
• Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918) (← links)
• What makes propositional abduction tractable (Q2389658) (← links)
• Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
• Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
• Matrix partitions of perfect graphs (Q2433706) (← links)
• An explicit solution to Post's problem over the reals (Q2479313) (← links)
• Complexity of clausal constraints over chains (Q2480746) (← links)
• Resource bounded immunity and simplicity (Q2576870) (← links)
• The constraint satisfaction problem and universal algebra (Q2795309) (← links)
• Complexity classification of local Hamiltonian problems (Q2799351) (← links)
• A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
• Permutation Groups and the Graph Isomorphism Problem (Q2821703) (← links)
• $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? (Q2946755) (← links)
• Is Polynomial Time Choiceless? (Q2947174) (← links)
• A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
• Complexity with Rod (Q2970952) (← links)
• Many Facets of Dualities (Q2971613) (← links)
• Many-one reductions and the category of multivalued functions (Q2973252) (← links)
• On the CSP Dichotomy Conjecture (Q3007637) (← links)
• Classes of bounded nondeterminism (Q3034815) (← links)
• NP for Combinatorialists (Q3503495) (← links)
• Non-dichotomies in Constraint Satisfaction Complexity (Q3519501) (← links)
• THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS (Q3569272) (← links)
• On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants (Q3576067) (← links)
• Finding Reductions Automatically (Q3586003) (← links)
• On the embedding of distributive lattices into recursive polynomial degrees (Q3778007) (← links)
• Classifying the computational complexity of problems (Q3781088) (← links)
• Strong reducibilities (Q3942949) (← links)