456 results on '"FORTNOW, LANCE"'
Search Results
52. Infinitely-Often Autoreducible Sets
53. Prediction and Dimension
54. Optimal Proof Systems and Sparse Sets
55. One-Sided Versus Two-Sided Error in Probabilistic Computation
56. Distributionally-Hard Languages
57. Nearly optimal language compression using extractors
58. Results on resource-bounded measure
59. Resource-bounded kolmogorov complexity revisited
60. The Complexity of Forecast Testing
61. Complexity classes of equivalence problems revisited
62. Extracting Kolmogorov complexity with applications to dimension zero-one laws
63. Measure, category and learning theory
64. Resource-bounded instance complexity : Extended abstract
65. Beyond PNP=NEXP
66. Fifty years of P vs. NP and the possibility of the impossible
67. Enumerations of the Kolmogorov Function
68. My favorite ten complexity theorems of the past decade
69. Separability and one-way functions
70. On the power of two-local random reductions
71. Gap-definability as a closure property
72. Interactive proof systems and alternating time-space complexity
73. Worlds to Die Harder For Open Oracle Questions for the 21st Century
74. A Personal View of the P versus NP Problem
75. Computational Complexity
76. Algebraic Methods in Quantum and Classical Models of Computation (Dagstuhl Seminar 02421)
77. Low-Depth Witnesses are Easy to Find
78. Inseparability and Strong Hypotheses for Disjoint NP Pairs
79. Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
80. Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
81. Sophistication Revisited
82. On the Complexity of Succinct Zero-Sum Games
83. A tight lower bound for restricted pir protocols
84. Learning Reductions to Sparse Sets
85. Some Results on Derandomization
86. Separability and one-way functions
87. Robust Simulations and Significant Separations
88. Computational depth: Concept and applications
89. Unconditional Lower Bounds against Advice
90. Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
91. Efficient Learning Algorithms Yield Circuit Lower Bounds
92. Kolmogorov Complexity with Error
93. Increasing Kolmogorov Complexity
94. Computation in a distributed information market
95. Betting Boolean-style: a framework for trading in securities based on logical formulas
96. INTRODUCTORY REMARKS
97. The status of the P versus NP problem
98. Using Depth to Capture Average-Case Complexity
99. Sophistication Revisited
100. Infinitely-Often Autoreducible Sets
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.