On the power of polynomial time bit-reductions

Proceedings of the Eighth Annual Structure in Complexity Theory Conference

Volumn , Issue , 1993, Pages 200-202

  Hertrampf, Ulrich ^a   Lautemann, Clemens ^a   Schwentick, Thomas ^a   Vollmer, Heribert ^a   Wagner, Klaus W ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; POLYNOMIALS; RANDOM PROCESSES; TURING MACHINES;

BIT-REDUCIBLE SETS; LANGUAGE CLASS CLOSURE; LEAF LANGUAGES; LEAF STRINGS; NONDETERMINISTIC TURING MACHINES; POLYNOMIAL TIME BIT REDUCTIONS; POLYNOMIAL TIME TURING MACHINES;

SET THEORY;

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

References (19)