199 search results - page 29 / 40 » Denotations for Classical Proofs - Preliminary Results |
93
Voted
WINE
2007
Springer
15 years 5 months ago
2007
Springer
This paper characterizes the family of truthful doublesided auctions. Despite the importance of double-sided auctions to market design, to date no characterization of truthful dou...
100
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
STOC
2009
ACM
16 years 11 days ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...