The following pages link to Sh. T. Ishmukhametov (Q465141):
Displaying 43 items.
- On distribution of semiprime numbers (Q465143) (← links)
- There are no maximal low d.c.e. degrees (Q558429) (← links)
- Working below a \(low_ 2\) recursively enumerable degree (Q584251) (← links)
- (Q588643) (redirect page) (← links)
- One approach to factorization of positive integers (Q647854) (← links)
- Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960) (← links)
- Infima in the d.r.e. degrees (Q685080) (← links)
- (Q726417) (redirect page) (← links)
- An algorithm for counting smooth integers (Q726419) (← links)
- (Q1115862) (redirect page) (← links)
- Index sets related to prompt simplicity (Q1115863) (← links)
- (Q1201780) (redirect page) (← links)
- Strong minimal pair theorem for the honest polynomial degrees of \(\Delta{}^ 0_ 2\) low sets (Q1201781) (← links)
- A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397) (← links)
- Splitting theorems and the jump operator (Q1295399) (← links)
- On the r. e. predecessors of d. r. e. degrees (Q1306796) (← links)
- Sub-Turing reducibilities of restricted complexity (Q1311145) (← links)
- The continuity of cupping to \(\text \textbf{0}'\) (Q1314642) (← links)
- The extendibility of relatively capping degrees under the weak truth table reducibility (Q1334032) (← links)
- Minimal pairs in initial segments of the recursively enumerable degrees (Q1366939) (← links)
- Iterated trees of strategies and priority arguments (Q1387095) (← links)
- Isolation and the high/low hierarchy (Q1407540) (← links)
- On relative enumerability of Turing degrees (Q1568706) (← links)
- Classes bounded by incomplete sets (Q1602854) (← links)
- Embedding of countable orders in Turing degrees (Q1810239) (← links)
- On restricted forms of enumeration reducibility (Q1814011) (← links)
- Some orbits for \({\mathcal E}\) (Q1840464) (← links)
- On decomposition of the \(0'\) degree into lesser \(T\)-degrees containing differences of recursively enumerable sets (Q1897906) (← links)
- On distributivity of the upper semilattices of the degrees below \(0'\) (Q1902712) (← links)
- Nonbounding and Slaman triples (Q1919544) (← links)
- Atomless \(r\)-maximal sets (Q1961349) (← links)
- Some reducibilities and splittings of recursively enumerable sets (Q1972524) (← links)
- The error probability of the Miller-Rabin primality test (Q1992114) (← links)
- A new primality test for natural integers (Q2112332) (← links)
- An effective programming of GCD algorithms for natural numbers (Q2225857) (← links)
- An approximating \(k\)-ary GCD algorithm (Q2361674) (← links)
- On practical aspects of the Miller-Rabin primality test (Q2442488) (← links)
- 1-generic splittings of computably enumerable degrees (Q2576946) (← links)
- (Q2888033) (← links)
- (Q3325708) (← links)
- (Q3344194) (← links)
- On a modification of the Lucas primality test (Q6059293) (← links)
- On a combined primality test (Q6132648) (← links)
