On adaptive versus nonadaptive bounded query machines
type: Item
instance of: scholarly article
title: On adaptive versus nonadaptive bounded query machines
zbMATH Open document ID: 0731.68034
DOI: 10.1016/0304-3975(91)90171-W
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D10
zbMATH DE Number: 4209583
zbMATH Keywords: adaptive computation
zbMATH Keywords: nonadaptive computation
zbMATH Keywords: bounded query machines
author: Ker-I Ko
MaRDI profile type: Publication
cites work: Bounded queries to SAT and the Boolean hierarchy
cites work: Terse, superterse, and verbose sets
cites work: On Sets Truth-Table Reducible to Sparse Sets
cites work: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
cites work: Distinguishing conjunctive and disjunctive reducibilities by sparse sets
cites work: The difference and truth-table hierarchies for NP
cites work: A comparison of polynomial time reducibilities
cites work: Q3807187
full work available at URL: 0304-3975(91)90171-w
OpenAlex ID: W2006605275
description: scientific article; zbMATH DE number 4209583