Sökresultat - "Theory of computation."

Negation-limited circuit complexity of symmetric functions. av Tanaka, Keisuke

Revisiting a result of Ko. av Cintioli, Patrizio

Extractors and pseudorandom generators. av Travisan, L.

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. av Kaplan, Haim

Numerical Algorithms [ejournal].

Available for University of the Philippines Diliman via Springerlink. Click here to access

Ergodicity of linear cellular automata over Zm. av Sato, Tadakazu

ACM transactions on economics and computation.

Available for University of the Philippines Diliman via ACM Digital Library . Click here to access

Some optimal inapproximability results. av Håstad, Johan

A unified theory of shared memory consistency. av Steinke, Robert C.

Order [ejournal].

Available for University of the Philippines Diliman via Springerlink. Click here to access