Skip to search formSkip to main contentSkip to account menu

L/poly

In computational complexity theory, L/poly is the complexity class of logarithmic space machines with a polynomial amount of advice. L/poly is a non… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Advice (complexity)BPL (complexity)Binary decision diagramCircuit complexity

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Zero-Suppressed Computation: A New Computation Inspired by ZDDs
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most… 
2016
2016
Isolation Lemma for Directed Reachability and NL vs. L
In this work we study the problem of efficiently isolating witnesses for the complexity classes NL and LogCFL, which are two well… 
2003
2003
Derandomization and distinguishing complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [E. Allender (2001… 
2003
2003
Conditional and Unconditional Separations of Dynamic Complexity Classes
Dynamic computational complexity is the study of resource b ounded dynamic computation. We study the computational power of a… 
1994
1994
NL/poly /spl sube/ /spl oplus/L/poly
  • Avi Wigderson
  • Proceedings of IEEE 9th Annual Conference on…
  • 1994
  • Corpus ID: 117272803
The article provides logspace analogs of the results of Valiant-Vazirani (L.G. Valiant and V.V. Vazirsni, 1986). We first show… 
1988
1988
The Power of Polynomial Size Omega-Branching Programs
In the following new types of branching programs, so-called Ω-branching programs, \(\Omega \subseteq \mathbb{B}_2\), are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)