The following pages link to (Q4942157):
Displaying 50 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
- Asymptotic granularity reduction and its application (Q719278) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- Influence maximization problem: properties and algorithms (Q830929) (← links)
- A note on quadratic residuosity and UP (Q834917) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- A note on width-parameterized SAT: an exact machine-model characterization (Q990090) (← links)
- Non-unique probe selection and group testing (Q995556) (← links)
- Jordan curves with polynomial inverse moduli of continuity (Q995570) (← links)
- Minimal achievable approximation ratio for MAX-MQ in finite fields (Q1019747) (← links)
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts (Q1034609) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Simple explanation of the no-free-lunch theorem and its implications (Q1411370) (← links)
- Polynomially-bounded Dehn functions of groups (Q1630588) (← links)
- Positive influence domination in graphs (Q2082361) (← links)
- Liouville numbers and the computational complexity of changing bases (Q2106591) (← links)
- On the complexity of conversion between classic real number representations (Q2106593) (← links)
- A new algorithm design technique for hard problems (Q2173301) (← links)
- Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP (Q2253865) (← links)
- Computation of algebraic numbers and arithmetic operations over them with linear memory (Q2261733) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete (Q2306657) (← links)
- \(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422) (← links)
- Relativized collapsing between BPP and PH under stringent oracle access (Q2390241) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- On the complexity of non-unique probe selection (Q2474080) (← links)
- Computational power of infinite quantum parallelism (Q2498972) (← links)
- Resource bounded immunity and simplicity (Q2576870) (← links)
- Space functions of groups (Q2841376) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security (Q3196425) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- The polynomial hierarchy for some structures over the binary words (Q3423149) (← links)
- Improved lower bounds on the randomized complexity of graph properties (Q3437025) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Arthur and Merlin as Oracles (Q3599130) (← links)
- Polynomial-time right-ideal morphisms and congruences (Q4686444) (← links)
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
- On the Complexity of the Pancake Problem (Q4921438) (← links)
- Jordan Curves with Polynomial Inverse Moduli of Continuity (Q4921453) (← links)
- (Q5150651) (← links)
- $LINSPACE$ конструктивный аналог функции $(1+x)^h$ (Q5222062) (← links)
- On the complexity of the pancake problem (Q5307616) (← links)
- Managing complexity in industrial collaborations (Q5385486) (← links)