#### Filter Results:

#### Publication Year

2006

2007

#### Publication Type

#### Publication Venue

#### Key Phrases

Learn More

- Blake Hegerle
- ArXiv
- 2007

In [1], the claim is put forth that P=NP; the form of this claim is an algorithm which purportedly can solve the 3SAT problem in O(n 4) time. The 3SAT problem (or " 3-SAT problem, " as it is refered to in [1]) is to determine if the formula d 1 ∧ d 2 ∧ · · · ∧ d m (1) is satisfiable, where each clause d k with 1 ≤ k ≤ m is a disjunction of at most three… (More)

- Blake Hegerle
- ArXiv
- 2006

We consider, as a means of making programming languages more flexible and powerful, a parsing algorithm in which the parser may freely modify the grammar while parsing. We are particularly interested in a modification of the canonical LR(1) parsing algorithm in which, after the reduction of certain productions, we examine the source sentence seen so far to… (More)

- ‹
- 1
- ›