Can I read Constant Depth Computation in Complexity on EtoBox?
Constant Depth Computation in Complexity by Indra Budhi Kurniawan is a document available to read on EtoBox.
What is Constant Depth Computation in Complexity about?
The document discusses computational complexity theory and constant depth computation. It introduces three key topics: 1. Constant depth computation models like alternating Turing machines with random access and logspace uniform circuit families. These define complexity classes like NC, AC, and L. 2. Complete problems for the class L, such as forest accessibility problem (FAP) and path accessibility problem (PAP). 3. The complexity class TC0, which extends AC0 with an oracle for the majority function.
- Author
- Indra Budhi Kurniawan
- Language
- EN