Nondeterministic NC1 computation

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1996, Pages 12-21

  Caussinus, Herve ^a   McKenzie, Pierre ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATION THEORY; DIGITAL CIRCUITS; EQUIVALENCE CLASSES; FINITE AUTOMATA; FORMAL LANGUAGES; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; TREES (MATHEMATICS);

ALGEBRAIC CIRCUITS; BOOLEAN CIRCUITS; BOUNDED WIDTH BRANCHING PROGRAMS; FINITE AUTOMATON MODEL; LEAP LANGUAGE; NONDETERMINISTIC COMPUTATION; PADDING TECHNIQUES; PROOF TREES;

COMPUTATIONAL COMPLEXITY;

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

References (25)