Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

59

FOCS
1989
IEEE

favoriteEmaildiscussreport

60views Theoretical Computer Science» more FOCS 1989»

An Optimal Lower Bound on the Number of Variables for Graph Identification

15 years 1 months ago

An Optimal Lower Bound on the Number of Variables for Graph Identification

Download www.cs.umass.edu

Jin-yi Cai, Martin Fürer, Neil Immerman

Real-time Traffic

FOCS 1989 | Theoretical Computer Science |

claim paper

Related Content

» Limits and Possibilities of BDDs in State Space Search

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

» Geometric lower bounds for parametric matroid optimization

» Optimal space lower bounds for all frequency moments

» Lower Bounds for Howards Algorithm for Finding Minimum MeanCost Cycles

» Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions

» Solving MAXrSAT Above a Tight Lower Bound

» Lower Bound Estimation for Low Power HighLevel Synthesis

» Lower bounds for adaptive linearity tests

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1989
Where	FOCS
Authors	Jin-yi Cai, Martin Fürer, Neil Immerman

Comments (0)