The following pages link to (Q3996675):
Displayed 50 items.
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Nontriviality for exponential time w.r.t. weak reducibilities (Q391074) (← links)
- The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) (Q391177) (← links)
- A personal account of Turing's imprint on the development of computer science (Q465701) (← links)
- A recursion-theoretic approach to NP (Q639668) (← links)
- On the computational complexity of behavioral description-based web service composition (Q650907) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- Nondeterministic, probabilistic and alternating computations on cellular array models (Q673634) (← links)
- Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- Comparing nontriviality for E and EXP (Q693048) (← links)
- The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- Computational complexity of logical theories of one successor and another unary function (Q868664) (← links)
- A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
- Reversal complexity revisited (Q935164) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Structural properties of oracle classes (Q990941) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- On random oracle separations (Q1182108) (← links)
- A survey of space complexity (Q1193412) (← links)
- NC algorithms for real algebraic numbers (Q1201334) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- Exponential-time and subexponential-time sets (Q1261474) (← links)
- A positive relativization of polynomial time versus polylog space (Q1261484) (← links)
- Some complexity bounds for subtype inequalities (Q1275620) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- The relative power of logspace and polynomial time reductions (Q1312179) (← links)
- On symmetric differences of NP-hard sets with weakly P-selective sets (Q1314375) (← links)
- Some descriptive-set-theoretical problems in complexity theory (Q1328888) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- On resource-bounded instance complexity (Q1351945) (← links)
- An excursion to the Kolmogorov random strings (Q1362331) (← links)
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- Separating classes in the exponential-time hierarchy from classes in PH (Q1365687) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- The zero-one law holds for BPP (Q1575726) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Sparse sets and collapse of complexity classes (Q1854459) (← links)
- The guarded fragment with transitive guards (Q1877098) (← links)
- Bi-immunity separates strong NP-completeness notions (Q1887166) (← links)
- On logics with two variables (Q1960419) (← links)
- Two queries (Q1961371) (← links)
- Hard sets are hard to find (Q1961379) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- The polynomial hierarchy of functions and its levels (Q2062128) (← links)
- Polylog depth, highness and lowness for E (Q2304528) (← links)