Geodesic

Volume 19 (2012) no. 3

Table of contents

The computation complexity in the class of formulas
p. 3-12
On complexity of optimal recombination for one scheduling problem with setup times
p. 13-26
Approximation algorithms for some NP-hard problems of searching a vectors subsequence
p. 27-38
On minimal realizations of linear Boolean functions
p. 39-57
Effective solvability of the independent set problem in a class of graphs without induced path and cycle with five vertices and a big clique
p. 58-64
Preemptive routing open shop on a link
p. 65-78
On minimal complexes of faces in the unit cube
p. 79-99