http:^^www.cs.washington.edu^homes^beame^papers.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 37 行
HTML
37 行
Date: Tue, 10 Dec 1996 15:20:41 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Sun, 20 Oct 1996 19:41:15 GMTContent-length: 956<html><head><title>Paul Beame: papers</title></head><body><h1>Paul Beame: Selected Recent Papers</h1><li> <a href="clause.ps"> Simplified and Improved Resolution Lower Bounds</a> FOCS 96 </li><li> <a href="conn.ps"> Improved Depth Lower Bounds for Small Distance Connectivity</a> FOCS 95 </li><li> <a href="search.ps"> The Relative Complexity of NP Search Problems </a> STOC 95</li><li> <a href="stell.ps"> Lower Bounds for Hilbert's Nullstellensatz and propositional proofs</a> FOCS 94</li><li> <a href="primer.ps"> A Switching Lemma Primer </a></li><li> <a href="match.ps"> An Exponential Separation between the MatchingPrinciple and the Pigeonhole Principle </a></li><li> <a href="crew.ps"> Separating the Power of EREW and CREW PRAMs with Small Communication Width </a></li><li> <a href="bag.ps"> Time-Space Tradeoffs for Undirected Graph Traversal </a></li></body><address><hr>beame@cs.washington.edu</address></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?