12597 search results - page 2398 / 2520 » Complexity of Mechanism Design |
230
Voted
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
262
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
159
Voted
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
185
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
145
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...