On balanced versus unbalanced computation trees (Q4887490): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4039803 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity classes and sparse oracles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A uniform approach to define complexity classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4268448 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3862379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logspace and logtime leaf languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complete sets and the polynomial-time hierarchy / rank | |||
Normal rank |
Latest revision as of 12:53, 24 May 2024
scientific article; zbMATH DE number 913012
Language | Label | Description | Also known as |
---|---|---|---|
English | On balanced versus unbalanced computation trees |
scientific article; zbMATH DE number 913012 |
Statements
On balanced versus unbalanced computation trees (English)
0 references
5 August 1996
0 references
leaf languages
0 references
nondeterministic polynomial-time machines
0 references
PP computations
0 references