Samuelson, P., The empirical implications of utility analysis (1938) Economica, 6 (4), pp. 344-356
Varian, H., Revealed preference (2006) Samuelsonian Economics and the 21st Century
Smeulders, B., Spieksma, F., Cherchye, L., De Rock, B., Goodness of fit measures for revealed preference tests: complexity results and algorithms. ACM Trans. Econ. Comput. 2(1) (2014) Article No, p. 3
Varian, H., The nonparametric approach to demand analysis (1982) Economica, 50 (4), pp. 945-976
Warshall, S., A theorem on boolean matrices (1962) J. Am. Assoc. Comput. Mach., 9 (1), pp. 11-12
Coppersmith, D., Winograd, S., Matrix multiplication via arithmetic progressions (1990) J. Symb. Comput., 9 (3), pp. 251-280
Skiena, S., (2008) The Algorithm Design Manual, , Springer, New York
Gutin, G., Sudakov, B., Yeo, A., Note on alternating directed cycles (1998) Discret. Math., 191, pp. 101-107
Gourvès, L., Lyra, A., Martinhon, C., Monnot, J., (2010) Complexity of paths, trails and circuits in arc-colored digraphs. Lecture Notes in Computer Science, vol. 6108, pp. 222–233, , Springer, Berlin
Tarjan, R., Depth-first search and linear graph algorithms (1972) SIAM J. Comput., 1 (2), pp. 146-160
Ben-Or, M., Lower bounds for algebraic computation trees (1983) Proceedings of 15th ACM Symposium on Theory of Computing, pp. 80–86. ACM
Yao, A.C., Lower bounds for algebraic computation trees with integer inputs (1991) SIAM J. Comput., 20 (4), pp. 655-668
