Searching for "The Complexity of Planar Counting Problems" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

The complexity of planar counting problems
by Madhav V. Marathe, Venkatesh Radhakrishnan, Richard E. Stearns, Rapport Xavier Pujol — 1998 — SIAM Journal on Computing
…THE COMPLEXITY OF PLANAR COUNTING PROBLEMS ARTICLE : HARRY B. HUNT III, MADHAV V. MARATHE…
Cited by 20 (0 self) – Add To MetaCart

The Complexity of Planar Counting Problems
by Harry B. Hunt, III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard, Richard E. Stearns — 1998
…THE COMPLEXITY OF PLANAR COUNTING PROBLEMS # HARRY B. HUNT III + , MADHAV V. MARATHE # , VENKATESH…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB