Preface to Special Issue: Theory and Applications of Models of Computation (TAMC).
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 5, doi. 10.1017/S0960129508007214
- By:
- Publication type:
- Article
Works matching IS 09601295 AND DT 2009 AND VI 19 AND IP 1
Results: 16
1
2
Cupping ?20enumeration degrees to 0e??
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 169, doi. 10.1017/S0960129508007378
- By:
- Publication type:
- Article
3
The method of the Yu?Ding Theorem and its application.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 207, doi. 10.1017/S0960129508007275
- By:
- Publication type:
- Article
4
MSC volume 19 issue 1 Cover and Back matter.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. b1, doi. 10.1017/S0960129509007452
- Publication type:
- Article
5
Principal filters definable by parameters in bT?
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 153, doi. 10.1017/S0960129508007354
- By:
- Publication type:
- Article
6
Phase transition of multivariate polynomial systems.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 9, doi. 10.1017/S0960129508007251
- By:
- Publication type:
- Article
7
A note on the feasibility of generalised universal composability?
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 193, doi. 10.1017/S0960129508007330
- By:
- Publication type:
- Article
8
MSC volume 19 issue 1 Cover and Front matter.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. f1, doi. 10.1017/S0960129508007408
- Publication type:
- Article
9
Editors' note: bibliometrics and the curators of orthodoxy.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 1, doi. 10.1017/S0960129508007391
- Publication type:
- Article
10
Non-cupping, measure and computably enumerable splittings.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 25, doi. 10.1017/S0960129508007226
- By:
- Publication type:
- Article
11
Absolutely non-computable predicates and functions in analysis?
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 59, doi. 10.1017/S096012950800724X
- By:
- Publication type:
- Article
12
On computably locally compact Hausdorff spaces.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 101, doi. 10.1017/S0960129508007366
- By:
- Publication type:
- Article
13
Quantum multiparty communication complexity and circuit lower bounds.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 119, doi. 10.1017/S0960129508007263
- By:
- Publication type:
- Article
14
Unary automatic graphs: an algorithmic perspective.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 133, doi. 10.1017/S0960129508007342
- By:
- Publication type:
- Article
15
Complexity of propositional projection temporal logic with star?
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 73, doi. 10.1017/S096012950800738X
- By:
- Publication type:
- Article
16
On universal computably enumerable prefix codes.
- Published in:
- Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 45, doi. 10.1017/S0960129508007238
- By:
- Publication type:
- Article