Sciweavers

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

46

JSYML
2002

favoriteEmaildiscussreport

61views more JSYML 2002»

On Polynomial Time Computation over Unordered Structures

14 years 9 months ago

On Polynomial Time Computation over Unordered Structures

Download shelah.logic.at

Andreas Blass, Yuri Gurevich, Saharon Shelah

Real-time Traffic

JSYML 2002 |

claim paper

Related Content

» Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables

» Designing an A Algorithm for Calculating Edit Distance between RootedUnordered Trees

» Tailoring Recursion to Characterize NonDeterministic Complexity Classes over Arbitrary Str...

» Implicit complexity over an arbitrary structure Quantifier alternations

» Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables

» Covering a Tree by a Forest

» An Embedding of the BSS Model of Computation in Light Affine LambdaCalculus

» Kernels over Relational Algebra Structures

» Multiview Matching for Unordered Image Sets or How Do I Organize My Holiday Snaps

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JSYML
Authors	Andreas Blass, Yuri Gurevich, Saharon Shelah

Comments (0)