Oldest pages

Showing below up to 50 results in range #101 to #150.

101. The complexity class NP‏‎ (13:19, 28 July 2009)
102. P=NP implies a deterministic algorithm to find primes‏‎ (13:35, 28 July 2009)
103. The complexity class DTIME‏‎ (13:38, 28 July 2009)
104. The complexity class BPP‏‎ (08:28, 29 July 2009)
105. The complexity class P‏‎ (09:13, 30 July 2009)
106. Pseudo-random generators (PRG)‏‎ (22:21, 31 July 2009)
107. The complexity class BQP‏‎ (14:01, 1 August 2009)
108. Finding primes with O(k) random bits‏‎ (04:07, 3 August 2009)
109. Friedlander-Iwaniec theorem‏‎ (09:08, 8 August 2009)
110. Factoring‏‎ (09:24, 8 August 2009)
111. Cramer's random model for the primes‏‎ (09:39, 8 August 2009)
112. Hardy-Littlewood prime tuples conjecture‏‎ (09:43, 8 August 2009)
113. The complexity class promise-BPP‏‎ (05:56, 9 August 2009)
114. List of results implied by the Riemann Hypothesis‏‎ (13:54, 9 August 2009)
115. Iterated sumsets of log-primes‏‎ (07:01, 12 August 2009)
116. Signed sums of prime reciprocals‏‎ (09:43, 12 August 2009)
117. Bertrand's postulate‏‎ (05:59, 18 August 2009)
118. Prime gaps‏‎ (15:39, 19 August 2009)
119. Discrete logarithm‏‎ (15:52, 19 August 2009)
120. Generic prime‏‎ (16:05, 19 August 2009)
121. Smooth number‏‎ (16:39, 19 August 2009)
122. Schinzel's hypothesis H‏‎ (16:49, 19 August 2009)
123. An efficient algorithm exists if Cramer's conjecture holds‏‎ (17:09, 19 August 2009)
124. Cramer's conjecture‏‎ (17:10, 19 August 2009)
125. Odlyzko's method‏‎ (10:02, 22 August 2009)
126. Kolmogorov complexity‏‎ (05:23, 28 August 2009)
127. Prime counting function‏‎ (12:58, 31 August 2009)
128. Polynomial strategy‏‎ (21:46, 18 September 2009)
129. Genetic algorithm‏‎ (23:15, 19 September 2009)
130. Corners theorem‏‎ (09:15, 16 October 2009)
131. TeX files for first paper‏‎ (09:59, 20 October 2009)
132. Line-free sets correlate locally with complexity-1 sets‏‎ (09:46, 21 October 2009)
133. Integer.tex‏‎ (15:11, 12 December 2009)
134. 6th roots of unity‏‎ (11:01, 9 January 2010)
135. 4th roots of unity‏‎ (11:06, 9 January 2010)
136. T32-invariant sequences‏‎ (06:21, 10 January 2010)
137. The HAP-subsequence structure of that sequence‏‎ (08:49, 10 January 2010)
138. T2(x) = -T3(x)‏‎ (12:03, 10 January 2010)
139. T2(x) = -x‏‎ (12:38, 10 January 2010)
140. T2(x) = T5(x) = -x‏‎ (13:39, 10 January 2010)
141. Convert raw input string into CSV table‏‎ (09:16, 11 January 2010)
142. Verify the bounded discrepancy of sequence‏‎ (11:44, 11 January 2010)
143. Verify the bounded discrepancy of an input sequence‏‎ (17:43, 11 January 2010)
144. Sequence of length 1112‏‎ (09:02, 12 January 2010)
145. HAP table for Sequence of length 1112‏‎ (09:04, 12 January 2010)
146. HAP tables for Sequence of length 470‏‎ (09:17, 12 January 2010)
147. Depth-first search‏‎ (14:06, 12 January 2010)
148. The first 1124-sequence‏‎ (18:43, 12 January 2010)
149. T m(x) = (+/-)T n(x)‏‎ (22:59, 12 January 2010)
150. Search for completely multiplicative sequences‏‎ (01:38, 13 January 2010)