Randomized Boolean decision trees: Several remarks
type: Item
instance of: scholarly article
title: Randomized Boolean decision trees: Several remarks
zbMATH Open document ID: 0916.68146
DOI: 10.1016/S0304-3975(98)00071-1
author: Nikolai K. Vereshchagin
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 1238745
zbMATH Keywords: Boolean decision trees
zbMATH Keywords: randomized algorithm
zbMATH Keywords: directional algorithms
zbMATH Keywords: undirectional algorithms
MaRDI profile type: Publication
cites work: Complexity classes without machines: on complete languages for UP
cites work: Q4739657
cites work: Lower bounds on probabilistic linear decision trees
cites work: Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
full work available at URL: s0304-3975(98)00071-1
OpenAlex ID: W2048106445
description: scientific article; zbMATH DE number 1238745