Syntactical analysis of non-size-increasing polynomial time computation

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2000, Pages 84-91

  Aehlig, Klaus ^a   Schwichtenberg, Helmet ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA STRUCTURES; ITERATIVE METHODS; THEOREM PROVING;

POLYNOMIAL TIME COMPUTABLE; SYNTACTICAL PROOF;

COMPUTATIONAL LINGUISTICS;

EID: 0033700292     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)