COMMENT ⊗   VALID 00004 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.DEVICE XGP
C00003 00003	.begin nofill
C00004 00004	.begin nofill
C00010 ENDMK
C⊗;
.DEVICE XGP;
.SINGLESCRIPT
.SPACING 10*5 MILLS;
.PAGE FRAME 48 HIGH 80 WIDE
.AREA TEXT LINES 1 TO 48
.
.turn on "↔" for "→"
.turn on "%,π,α,#,&,∂,↑,↓,[,]"
.turn on "∩" for "↑"
.turn on "∪" for "↓"
.font 1 "ngr40l";
.font 3 "math30";
.at "|cd" ⊂"%3α*%*"⊃
.
.select 1
.
.PLACE TEXT;
.
.NEXT PAGE
.begin nofill
↔ 
.skip 5
.begin center
A POLYNOMIAL TIME ALGORITHM FOR SOLVING SYSTEMS OF LINEAR
INEQUALITIES WITH TWO VARIABLES PER INEQUALITY
.skip
by
.skip
Bengt Aspvall and Yossi Shiloach
.skip 5
STAN-CS-79-703
January 1979
.skip 4
C O M P U T E R   S C I E N C E   D E P A R T M E N T
School of Humanities and Sciences
STANFORD UNIVERSITY
.end
.next page
.begin nofill
↔ 
.skip 5
.begin center
THE PEBBLING PROBLEM IS COMPLETE IN POLYNOMIAL SPACE
.skip
by
.skip
John R. Gilbert, Thomas Lengauer, and Robert Endre Tarjan
.skip 5
STAN-CS-79-717
February 1979
.skip 4
C O M P U T E R   S C I E N C E   D E P A R T M E N T
School of Humanities and Sciences
STANFORD UNIVERSITY
.end
.next page