Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,402,840 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Computational complexity theory
Computational geometry
Decision problem
NP (complexity)
Non-deterministic Turing machine
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A contract-based method to specify stimulus-response requirements
Alexandr Naumchev
,
M. Mazzara
,
B. Meyer
,
J. Bruel
,
Florian Galinier
,
S. Ebersold
arXiv.org
2017
Corpus ID: 5291690
A number of formal methods exist for capturing stimulus-response requirements in a declarative form. Someone yet needs to…
Expand
2015
2015
Belief-propagation reconstruction for compressed sensing: Quantization vs. Gaussian approximation
Mengke Lian
,
H. Pfister
Allerton Conference on Communication, Control…
2015
Corpus ID: 18561590
This work considers the compressed sensing (CS) of i.i.d. signals with sparse measurement matrices and belief-propagation (BP…
Expand
2013
2013
The CHR-based Implementation of the SCIFF Abductive System
M. Alberti
,
Marco Gavanelli
,
E. Lamma
Italian Conference on Computational Logic
2013
Corpus ID: 9432705
Abduction is a form of inference that supports hypothetical reasoning and has been applied to a number of domains, such as…
Expand
2011
2011
Convex hull of points lying on lines in time after preprocessing
Esther Ezra
,
Wolfgang Mulzer
Computational geometry
2011
Corpus ID: 15651432
2010
2010
Iterative decoding beyond belief propagation
S. Planjery
,
S. K. Chilappagari
,
B. Vasic
,
D. Declercq
,
Ludovic Danjean
Information Theory and Applications Workshop
2010
Corpus ID: 11321331
At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by…
Expand
2008
2008
Local computation of β-reduction 1 A concrete presentation of Game Semantics 2
W. Blum
,
C. Ong
2008
Corpus ID: 10384067
5 We show that ...
1998
1998
Reasoning about efficiency within a probabilistic µ-calculus
Annabelle McIver
PROBMIV
1998
Corpus ID: 15079283
1998
1998
A comment on a minmax location problem
G. Woeginger
Operations Research Letters
1998
Corpus ID: 206031036
Review
1985
Review
1985
Parallelism in AI Programs
D. Kibler
,
J. Conery
International Joint Conference on Artificial…
1985
Corpus ID: 9698214
A folk theorem is developing which suggests that parallel solution of AI programs will not afford a speedup of more than one…
Expand
1967
1967
Computable Functionals of Finite Type I
R. Gandy
1967
Corpus ID: 118282299
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE