Theory and Applications of Models of Computation (TAMC)
Jin-yi Cai, S. B. Cooper, Angsheng Li
págs. 5-7
Phase transition of multivariate polynomial systems
Giordano Fusco, Eric Bach
págs. 9-23
Non-cupping, measure and computably enumerable splittings
Georges Barmpalias, Anthony Morphett
págs. 25-43
On universal computably enumerable prefix codes
Cristian S. Calude, Ludwig Staiger
págs. 45-57
Absolutely non-computable predicates and functions in analysis
Klaus Weihrauch, Yongcheng Wu, Decheng Ding
págs. 59-71
Complexity of propositional projection temporal logic with star
Cong Tian, Zhenhua Duan
págs. 73-100
On computably locally compact Hausdorff spaces
Yatao Xu, Tanja Grubba
págs. 101-117
Quantum multiparty communication complexity and circuit lower bounds
Iordanis Kerenidis
págs. 119-132
Unary automatic graphs: an algorithmic perspective
Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes
págs. 133-152
Principal filters definable by parameters in EbT
Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang
págs. 153-167
Cupping Delta20 enumeration degrees to 0 e'
Mariya Ivanova Soskova, Guohua Wu
págs. 169-191
A note on the feasibility of generalised universal composability
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
págs. 193-205
págs. 207-215
© 2008-2024 Fundación Dialnet · Todos los derechos reservados