Showing below up to 50 results in range #51 to #100.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

51. (hist) ‎Resolution lower bounds for the weak functional pigeonhole principle ‎[115 bytes]
52. (hist) ‎BPP and the polynomial hierarchy ‎[115 bytes]
53. (hist) ‎Disjointness is hard in the multiparty number-on-the-forehead model ‎[115 bytes]
54. (hist) ‎On the complexity of matrix product ‎[115 bytes]
55. (hist) ‎A theory of the learnable ‎[115 bytes]
56. (hist) ‎Correcting errors beyond the Guruswami-Sudan radius in polynomial time ‎[115 bytes]
57. (hist) ‎Pseudorandom generators for space-bounded computation ‎[115 bytes]
58. (hist) ‎Natural Proofs ‎[115 bytes]
59. (hist) ‎Sampling adsorbing staircase walks using a new Markov chain decomposition method ‎[115 bytes]
60. (hist) ‎Unbalanced expanders and randomness extractors from parvaresh-vardy codes ‎[115 bytes]
61. (hist) ‎Large Deviation Bounds for Markov Chains ‎[115 bytes]
62. (hist) ‎Universal sequential search problems ‎[115 bytes]
63. (hist) ‎Digitalized Signatures and Public-Key Functions as Intractable as Factorization ‎[115 bytes]
64. (hist) ‎Derandomizing polynomial identity tests means proving circuit lower bounds ‎[115 bytes]
65. (hist) ‎Factoring numbers in O(logn) arithmetic steps ‎[115 bytes]
66. (hist) ‎Application of Boolean Algebra to Switching Circuit Design and to Error Detection ‎[115 bytes]
67. (hist) ‎Matching is as easy as matrix inversion ‎[115 bytes]
68. (hist) ‎Randomness-efficient sampling within NC1 ‎[115 bytes]
69. (hist) ‎Pseudo-random generators for all hardnesses ‎[115 bytes]
70. (hist) ‎On the Structure of Polynomial Time Reducibility ‎[115 bytes]
71. (hist) ‎An O(log n log log n) Space Algorithm for Undirected st-connectivity ‎[115 bytes]
72. (hist) ‎Games against nature ‎[115 bytes]
73. (hist) ‎Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution ‎[115 bytes]
74. (hist) ‎Extractors and pseudorandom generators ‎[115 bytes]
75. (hist) ‎Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack ‎[115 bytes]
76. (hist) ‎Are Recursion Theoretic Arguments Useful in Complexity Theory? ‎[115 bytes]
77. (hist) ‎Founding Cryptography on Oblivious Transfer ‎[115 bytes]
78. (hist) ‎Tight estimates for eigenvalues of regular graphs ‎[115 bytes]
79. (hist) ‎The influence of variables on Boolean functions ‎[115 bytes]
80. (hist) ‎Hierarchies of memory limited computations ‎[115 bytes]
81. (hist) ‎Towards the parallel repetition conjecture ‎[115 bytes]
82. (hist) ‎Monotone Circuits for Connectivity Require Super-Logarithmic Depth ‎[115 bytes]
83. (hist) ‎Algebraic methods in the theory of lower bounds for Boolean circuit complexity ‎[115 bytes]
84. (hist) ‎Some optimal inapproximability results ‎[115 bytes]
85. (hist) ‎Cryptographic Limitations on Learning Boolean Formulae and Finite Automata ‎[115 bytes]
86. (hist) ‎On the generation of cryptographically strong pseudo-random sequences ‎[115 bytes]
87. (hist) ‎A complexity theoretic approach to randomness ‎[115 bytes]
88. (hist) ‎Ramanujan graphs ‎[115 bytes]
89. (hist) ‎Undirected ST-connectivity in log-space ‎[115 bytes]
90. (hist) ‎Dropbox Quick Start ‎[115 bytes]
91. (hist) ‎Reliable Quantum Computers (1997) ‎[115 bytes]
92. (hist) ‎The unified theory of pseudorandomness: guest column ‎[115 bytes]
93. (hist) ‎Randomized algorithms ‎[115 bytes]
94. (hist) ‎Private coins versus public coins in interactive proof systems ‎[115 bytes]
95. (hist) ‎Inapproximability of Combinatorial Optimization Problems ‎[115 bytes]
96. (hist) ‎Lower bounds on the size of bounded depth circuits over a complete basis with logical addition ‎[115 bytes]
97. (hist) ‎Lower bounds on probabilistic linear decision trees ‎[115 bytes]
98. (hist) ‎Fault Tolerant Quantum Computation ‎[115 bytes]
99. (hist) ‎A Kilobit Special Number Field Sieve Factorization ‎[115 bytes]
100. (hist) ‎Lattice Based Cryptography ‎[115 bytes]

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)