Computation tree

A computation tree is a representation for the computation steps of a non-deterministic Turing machine on a specified input. A computation tree is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A computation tree of a program execution describes computations of functions and their dependencies. A computation tree… (More)
  • figure 3
  • figure 5
  • figure 8
  • figure 9
  • figure 10
Is this relevant?
2008
2008
The computation trees of the Tutte Polynomial algorithm are very large. Understanding the effects of applying heuristics to the… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
Is this relevant?
2008
2008
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Conventionally, in each low-density parity-check (LDPC) decoding iteration all the variable nodes and subsequently all the check… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
1997
1997
We show that any algebraic computation tree or any fixed-degree algebraic tree for solving the membership question of a compact… (More)
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In this paper, we present algorithms for enumeration of spanning trees in undi-rected graphs, with and without weights. The… (More)
Is this relevant?
1985
1985
Given a general arithmetic expression, we find a computation binary tree representation in <italic>O</italic>(log <italic>n… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decision… (More)
Is this relevant?
1981
1981
We examine three ways of restricting the size (and shape) of the accepting computation trees of alternating Turing machines. We… (More)
  • figure 5
Is this relevant?