173 search results - page 26 / 35 » A Proof of the Two-path Conjecture |
FOCS
1998
IEEE
14 years 27 days ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
ATVA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
CCCG
2006
13 years 10 months ago
2006
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
COMBINATORICS
2006
13 years 8 months ago
2006
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
JCT
2007
13 years 8 months ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...