scientific article; zbMATH DE number 7204255

DOI10.4230/LIPIcs.CCC.2017.4zbMath1440.68130arXiv1611.06632MaRDI QIDQ5111134

Aaron Potechin

Publication date: 26 May 2020

Full work available at URL: https://arxiv.org/abs/1611.06632

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branching programsspace complexityamortization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical models of computation (Turing machines, etc.) (68Q04) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations

This page was built for publication: