Oldest pages

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

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