Transdichotomous model
id:
transdichotomous-model-305-4853272
title:
Transdichotomous model
text:
In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of the random-access machine in which the machine word size is assumed to match the problem size. The model was proposed by Michael Fredman and Dan Willard, who chose its name "because the dichotomy between the machine model and the problem size is crossed in a reasonable manner." In a problem such as integer sorting in which there are n integers to
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Transdichotomous_model
date created:
date modified:
2023-09-11T10:12:01Z
main entity:
{"identifier":"Q7833959","url":"https://www.wikidata.org/entity/Q7833959"}
image:
fields total:
13
integrity:
13