Skip to search formSkip to main contentSkip to account menu

Sipser–Lautemann theorem

Known as: Sipser-Lautemann theorem, Sipser-Gacs-Lautemann theorem, Lautemann 
In computational complexity theory, the Sipser–Lautemann theorem or Sipser–Gács–Lautemann theorem states that bounded-error probabilistic polynomial… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Arthur–Merlin protocolBPP (complexity)Complement (complexity)Computational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Tree-to-Graph Transductions with Scope
High-level natural language processing requires formal languages to represent semantic information. A recent addition of this… 
2016
2016
Between a Rock and a Hard Place – Parsing for Hyperege Replacement DAG Grammars
We study the uniform membership problem for hyperedgereplacement grammars that generate directed acyclic graphs. The study of… 
Review
2015
Review
2015
On the real-state processing of regular operations and the Sakoda-Sipser problem
In this work we study some aspects of state-complexity related to the very famous Sakoda-Sipser problem. We study the state… 
2010
2010
Complexity Invariance of Real Interpretations
In the field of implicit computational complexity, we are considering in this paper the fruitful branch of interpretation methods… 
2008
2008
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
The algorithm of Cocke, Younger, and Kasami is a dynamic programming technique well-known from string parsing. It has been… 
2006
2006
Phenotypic characterization of Pseudomonas fluorescens PfG32R and its spontaneous gacS mutants and biocontrol activity against bacterial wilt disease of tomato
Pseudomonas fluorescens strain PfG32R actively suppresses the occurrence of bacterial wilt disease of tomato caused by Ralstonia… 
1998
1998
Nearly Optimal Language Compression Using Extractors
We show two sets of results applying the theory of extractors to resource-bounded Kolmogorov complexity: - Most strings in easy… 
1996
1996
Formal Methods in VLSI System Design
We apply mathematical logic to a number of problems arising in very large scale integration (VLSI) design automation. The rst… 
1990
1990
Complexity of boundary graph languages
Les languages de graphes connexes et de degre borne qui sont engendres par des grammaires de type «boundary eNCE» sont dans LOG… 
1980
1980
Complexity of implementations on the level of algebraic specifications
The aim of this paper is to study implementations of abstract data types and their complexity within the framework of algebraic… 
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)