Complexity classes

Ningún artículo

2 exptime Ac0 Acc0 Ac complexity Ah complexity Apx Ap complexity Arthur merlin protocol Bpl complexity Bpp complexity Co np Co np complete Complement complexity Dlin Dspace Dtime Espace Exp Expspace Exptime E complexity Fnp complexity Fp complexity Fixed parameter tractable Function problem Logcfl L complexity Logarithmic space Nc complexity Nespace Nexp Nexpspace Nexptime Ne complexity Nlin Nl complexity Nonelementary Np easy Np equivalent Np hard Nspace Ntime Optimization problem P complete P poly Ph complexity Pl complexity Ppad complexity Pp complexity Pr complexity Pspace Pspace complete P np problem Polynomial time approximation scheme Probabilistically checkable proof Re complexity Rl complexity Rp complexity S2p complexity Sl complexity Sharp p Sharp p complete Tfnp Two sided error Up complexity Zpl complexity Zpp complexity Advice complexity Certificate complexity Complete complexity Low complexity Pseudo polynomial time Quasi polynomial time Ah Ap Bpl Bpp Ph Pl Pp Qip Rl Rp Zpl Zpp

Todavía no hay preguntas en esta categoría — están en camino.