Sciweavers

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

51

STACS
1992
Springer

favoriteEmaildiscussreport

86views Theoretical Computer Science» more STACS 1992»

A Theory of Strict P-completeness

15 years 1 months ago

A Theory of Strict P-completeness

Download www.cs.ubc.ca

Anne Condon

Real-time Traffic

STACS 1992 | Theoretical Computer Science |

claim paper

Related Content

» The Strict Order Property and Generic Automorphisms

» On the Strictness of the FirstOrder Quantifier Structure Hierarchy over Finite Structures

» Intuitionistic Fixed Point Theories for Strictly Positive Operators

» Formalization and Strictness of Simulation Event Orderings

» Enforcing strict modelview separation in template engines

» Strict bidirectional type checking

» GPS scheduling selection of optimal weights and comparison with strict priorities

» Formal Description of Autopoiesis Based on the Theory of Category

» Making stricterness more relevant

» Valued Hesitation in Intervals Comparison

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1992
Where	STACS
Authors	Anne Condon

Comments (0)