• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 180
  • 22
  • 18
  • 13
  • 9
  • 6
  • 6
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 2
  • 2
  • Tagged with
  • 321
  • 321
  • 105
  • 87
  • 76
  • 67
  • 44
  • 40
  • 38
  • 35
  • 28
  • 28
  • 26
  • 25
  • 25
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

The price of anarchy and a priority-based model of routing /

Olver, Neil. January 2006 (has links)
No description available.
42

Computational Distinguishability of Quantum Channels

Rosgen, William January 2009 (has links)
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be surprisingly hard: it is complete for the class QIP of problems that have quantum interactive proof systems, which implies that it is hard for the class PSPACE of problems solvable by a classical computation in polynomial space. Several restrictions of distinguishability are also shown to be hard. It is no easier when restricted to quantum computations of logarithmic depth, to mixed-unitary channels, to degradable channels, or to antidegradable channels. These hardness results are demonstrated by finding reductions between these classes of quantum channels. These techniques have applications outside the distinguishability problem, as the construction for mixed-unitary channels is used to prove that the additivity problem for the classical capacity of quantum channels can be equivalently restricted to the mixed unitary channels.
43

Computational Distinguishability of Quantum Channels

Rosgen, William January 2009 (has links)
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be surprisingly hard: it is complete for the class QIP of problems that have quantum interactive proof systems, which implies that it is hard for the class PSPACE of problems solvable by a classical computation in polynomial space. Several restrictions of distinguishability are also shown to be hard. It is no easier when restricted to quantum computations of logarithmic depth, to mixed-unitary channels, to degradable channels, or to antidegradable channels. These hardness results are demonstrated by finding reductions between these classes of quantum channels. These techniques have applications outside the distinguishability problem, as the construction for mixed-unitary channels is used to prove that the additivity problem for the classical capacity of quantum channels can be equivalently restricted to the mixed unitary channels.
44

On indexing large databases for advanced data models

Samoladas, Vasilis. January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2001. / Vita. Includes bibliographical references. Available also from UMI Company.
45

On the complexity of scheduling university courses a thesis /

Lovelace, April Lin. Brady, Lois. January 1900 (has links)
Thesis (M.S.)--California Polytechnic State University, 2010. / Mode of access: Internet. Title from PDF title page; viewed on March 19, 2010. Major professor: Lois Brady. "Presented to the faculty of California Polytechnic State University, San Luis Obispo." "In partial fulfillment of the requirements for the degree [of] Master of Science in Computer Science." "March 2010." Includes bibliographical references (p. 71).
46

Lower bound methods for multiparty communication complexity

Ford, Jeffrey Stephen 28 August 2008 (has links)
Not available / text
47

On indexing large databases for advanced data models

Samoladas, Vasilis 04 April 2011 (has links)
Not available / text
48

Crew scheduling, cutting stock, and column generation : Solving huge integer programs

Vance, Pamela H. 08 1900 (has links)
No description available.
49

A projective technique for accelerating convergence of the affine scaling algorithm for linear programming

Trigos, Federico 08 1900 (has links)
No description available.
50

A SURVEY OF LIMITED NONDETERMINISM IN COMPUTATIONAL COMPLEXITY THEORY

Levy, Matthew Asher 01 January 2003 (has links)
Nondeterminism is typically used as an inherent part of the computational models used incomputational complexity. However, much work has been done looking at nondeterminism asa separate resource added to deterministic machines. This survey examines several differentapproaches to limiting the amount of nondeterminism, including Kintala and Fischer's βhierarchy, and Cai and Chen's guess-and-check model.

Page generated in 0.1506 seconds