Universally serializable computation
From MaRDI portal
Publication:1384538
DOI10.1006/jcss.1997.1516zbMath0901.68065OpenAlexW2071416505MaRDI QIDQ1384538
Ogihara, Mitsunori, Hemaspaandra, Lane A.
Publication date: 4 August 1998
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5ec60335787cce8fc5dc5761db9e8b04f1533022
Related Items (2)
Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria ⋮ SELF-SPECIFYING MACHINES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the construction of parallel computers from various basis of Boolean functions
- The complexity of combinatorial problems with succinct input representation
- The complexity of optimization problems
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Turing machines with few accepting computations and low sets for PP
- On sparse hard sets for counting classes
- A comparison of polynomial time reducibilities
- Relativized counting classes: Relations among thresholds, parity, and mods
- STRONG SEPARATIONS FOR THE BOOLEAN HIERARCHY OVER RP
- PP is as Hard as the Polynomial-Time Hierarchy
- The Boolean Hierarchy I: Structural Properties
- The Boolean Hierarchy II: Applications
- On Sets with Efficient Implicit Membership Tests
- PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
- Complexity classes defined by counting quantifiers
- Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
- Fault-tolerance and complexity (Extended abstract)
- ON SERIALIZABLE LANGUAGES
- On the power of parity polynomial time
- Counting classes: Thresholds, parity, mods, and fewness
This page was built for publication: Universally serializable computation
