Linguistic characterization of bounded oracle computation and probabilistic polynomial time

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1998, Pages 725-733

  Mitchell, J ^a   Mitchell, M ^a   Scedrov, A ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MODAL ANALYSIS; POLYNOMIALS; PROBABILISTIC LOGICS; THEOREM PROVING;

BOUNDED ORACLE COMPUTATIONS; PROBABILISTIC POLYNOMIAL-TIME FUNCTIONS;

COMPUTATIONAL LINGUISTICS;

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

References (20)