𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Deterministic polynomial-time quantum algorithms for Simon’s problem

✍ Scribed by Takashi Mihara; Shao Chin Sung

Publisher
Springer
Year
2003
Tongue
English
Weight
211 KB
Volume
12
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On polynomial-time approximation algorit
On polynomial-time approximation algorithms for the variable length scheduling problem
✍ Artur Czumaj; Leszek Ga̧sieniec; Daya Ram Gaur; Ramesh Krishnamurti; Wojciech Ry 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 195 KB

This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), ( 2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1; k2, denoted VLSP(k1; k2). In the current paper, we ÿrst discuss a

A Polynomial-time Algorithm for the Bist
A Polynomial-time Algorithm for the Bistable Roommates Problem
✍ Jay Sethuraman; Chung-Piaw Teo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

On Linear-Time Deterministic Algorithms
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
✍ Bernard Chazelle; Jiřı́ Matoušek 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 208 KB

We show that with recently developed derandomization techniques, one can convert Clarkson's randomized algorithm for linear programming in fixed dimension into a linear-time deterministic algorithm. The constant of proportionality is d O Ž d . , which is better than those for previously known algori