Algorithmic Problems for Computation Trees
In this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems. The satisfiability problem is concerned with recognizing sentences...
Saved in:
| Main Author: | Mikhail Moshkov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Logics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2813-0405/3/2/4 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Performance of a simple ACO on the minimum label spanning tree problem
by: Xinsheng Lai, et al.
Published: (2025-04-01) -
Causality Analysis of Construction Failure Using The Event Tree Analysis Method and Fault Tree Analysis
by: Puspita Ambartiyas, et al.
Published: (2025-02-01) -
Forward Computational Modeling of Respiratory Airflow
by: Emmanuel A. Akor, et al.
Published: (2024-12-01) -
Improved tree structure anti-collision algorithm of RFID
by: Xue WANG, et al.
Published: (2015-07-01) -
Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph
by: Alexander V. Smirnov
Published: (2025-06-01)