Sökresultat - "Computation by abstract devices."

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

Exact analysis of Dodgson elections Lewis Carroll's 1876 voting system is complete for parallel access to NP. av Hemaspaandra, Edith

Quantum lower bounds by polynomials. av Beals, Robert

Scenarios and state machines: models, algorithms, and tools a summary of the 4th workshop. av Bontemps, Yves

Quantum lower bounds for the collision and the element distinctness problems. av Aaronson, Scott

Probabilistic checking of proofs a new characterization of NP. av Arora, Sanjeev

Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by reversals. av Hannenhalli, Sridhar

Advances in Neural Networks - ISNN 2011 8th International Symposium on Neural Networks, ISNN 2011, Guilin, China, May 29-June 1, 2011, Proceedings, Part III

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

Unlocking concurrency. av Adl-Tabatabai, Ali-Reza

Lower bounds on the bounded coefficient complexity of bilinear maps. av Bürgisser, Peter