nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Communication complexity of two decision problems
|
Björner, Anders |
|
1992 |
39 |
2 |
p. 161-163 3 p. |
artikel |
2 |
Computation and cognition: proceedings of the first NEC research symposium
|
|
|
1992 |
39 |
2 |
p. 195- 1 p. |
artikel |
3 |
Correlation in partially ordered sets
|
Fishburn, Peter C. |
|
1992 |
39 |
2 |
p. 173-191 19 p. |
artikel |
4 |
Games, equations and dot-depth two monoids
|
Blanchet-Sadri, F. |
|
1992 |
39 |
2 |
p. 99-111 13 p. |
artikel |
5 |
Generating bent sequences
|
Adams, C.M. |
|
1992 |
39 |
2 |
p. 155-159 5 p. |
artikel |
6 |
Hamiltonian cycle is polynomial on cocomparability graphs
|
Deogun, Jitender S. |
|
1992 |
39 |
2 |
p. 165-172 8 p. |
artikel |
7 |
Introduction to linear programming: applications and extensions
|
|
|
1992 |
39 |
2 |
p. 195-196 2 p. |
artikel |
8 |
Machine learning: paradigms and methods
|
|
|
1992 |
39 |
2 |
p. 195- 1 p. |
artikel |
9 |
Mathematical tools in production management
|
|
|
1992 |
39 |
2 |
p. 194-195 2 p. |
artikel |
10 |
Measure theoretic approach to the classification of cellular automata
|
Ishii, Shin'ichirou |
|
1992 |
39 |
2 |
p. 125-136 12 p. |
artikel |
11 |
Minimum perfect bipartite matchings and spanning trees under categorization
|
Richey, Michael B. |
|
1992 |
39 |
2 |
p. 147-153 7 p. |
artikel |
12 |
Neural network design and the complexity of learning
|
|
|
1992 |
39 |
2 |
p. 196- 1 p. |
artikel |
13 |
One-story buildings as tensegrity frameworks III
|
Recski, András |
|
1992 |
39 |
2 |
p. 137-146 10 p. |
artikel |
14 |
The complexity of lifted inequalities for the knapsack problem
|
Hartvigsen, David |
|
1992 |
39 |
2 |
p. 113-123 11 p. |
artikel |
15 |
Uses of randomness in algorithms and protocols
|
|
|
1992 |
39 |
2 |
p. 193-194 2 p. |
artikel |