523 search results - page 62 / 105 » On the Power of Quantum Proofs |
APAL
2010
14 years 12 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
ENTCS
2008
14 years 12 months ago
2008
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
APPML
2006
14 years 12 months ago
2006
Most balancing markets of electric power are organized as uniform-price auctions. In 2001, the balancing market of England and Wales switched to a pay-as-bid auction with the inte...
CPC
2006
14 years 12 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
183
click to vote
POPL
2001
ACM
16 years 4 days ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...