Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, June 17-19, 1997, Ramat-Gan, Israel
IEEE Computer Society Press, Jan 1, 1997 - Computers - 185 pages
This text covers the Israel Symposium on the Theory of Computing Systems and includes such topics as: effect of operators on straight line complexity; a comparison of resource-bounded molecular computational models; and an exact quantum polynomial-time algorithm for Simon's problem.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A Comparison of ResourceBounded Molecular Computation Models
An Exact Quantum PolynomialTime Algorithm for Simons Problem
Yannakakis vs GoemansWilliamson 24
14 other sections not shown
Other editions - View all
alternating automata apply arcs augmented path automaton Biichi broadcast algorithm combinatorial search competitive ratio complexity Computer Science consider construction contains data selection policy decision problem decomposition defined denote deterministic deterministic algorithm disjoint distribution edges element exists families of permutations fault faulty processor Figure finite function graph G Gx(k Hamiltonian cycle Hamiltonian paths IEEE infinite input integer least Lemma lopsided tree lower bound machine maximum matching mesh minimum T-cut modular decomposition neighbors nodes nondeterministic Note NP-complete number of coins on-line operation optimal oracle packet pair parallel queries polynomial polynomial-time problem Proc proof protocol prove quantum quantum algorithm quantum computer random randomized algorithms recursive repair counter right-module rithm Section sequence Simon's step stereoscopic family string strong modules subgraph subgroup subset subtree T-joins tion truth assignment Turing machines unit jobs upper bound variable vertex vertices weighted clauses