Titlebook: Computing and Combinatorics; First Annual Interna Ding-Zhu Du,Ming Li Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 Co

光明正大

規(guī)范要多

Expediency

,?quivalenz von W?rme und Arbeit,In ., one can decompose an .-vertex rectilinear polygon into . rectangles, allowing Steiner points, so that any horizontal or vertical segment inside the polygon intersects .(log.) rectangles.

slow-wave-sleep

PANEL

陰郁

commute

acquisition

Rectangulating rectilinear polygons in parallel,In ., one can decompose an .-vertex rectilinear polygon into . rectangles, allowing Steiner points, so that any horizontal or vertical segment inside the polygon intersects .(log.) rectangles.

conference

Carcinogen

,Testing containment of object-oriented conjunctive queries is ∏ 2 p -hard,We study the complexity of testing containment for a class of object-oriented conjunctive queries. We show that the containment problem is ∏.-hard. Together with a previous result, the containment problem is complete in ∏..