Pages that link to "Item:Q640476"
From MaRDI portal
The following pages link to Computability and complexity theory. (Q640476):
Displaying 23 items.
- The complexity of the \(K\)th largest subset problem and related problems (Q894449) (← links)
- \textsc{Hanano} puzzle is \textsf{NP}-hard (Q1730016) (← links)
- Bounded queries in recursion theory (Q1806349) (← links)
- On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
- Schema mapping coverage (Q2043432) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
- Theory of computation. (Q2492014) (← links)
- Machines that perform measurements (Q2672643) (← links)
- The theory of computability. Programs, machines, effectiveness and feasibility (Q3992696) (← links)
- (Q3998431) (← links)
- (Q4219291) (← links)
- (Q4671210) (← links)
- (Q4955547) (← links)
- A note on the complexity of S4.2 (Q5156186) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Computational Complexity (Q5320667) (← links)
- Computational Complexity (Q5900112) (← links)
- Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets (Q5918833) (← links)
- Computability and complexity theory (Q5925717) (← links)
- Effective guessing has unlikely consequences (Q6109068) (← links)
- Splitting NP-complete sets infinitely (Q6551699) (← links)
- Assortment optimization: a systematic literature review (Q6667801) (← links)