145 search results - page 12 / 29 » BQP and the Polynomial Hierarchy |
76
Voted
FPLE
1995
15 years 1 months ago
1995
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
JELIA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Often, decision making involves autonomous agents that are structured in a complex hierarchy, representing e.g. authority. Typically the agents share the same body of kno...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
138
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
96
Voted
ECCC
2007
14 years 9 months ago
2007
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...