1274 search results - page 84 / 255 » New Proofs for |
115
Voted
APVIS
2008
15 years 2 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
111
click to vote
ASE
2002
15 years 17 days ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
111
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...
121
Voted
AIL
2008
15 years 25 days ago
2008
The notions of burden of proof and presumption are central to law, but as noted in McCormick on Evidence, they are also the slipperiest of any of the family of legal terms employe...
137
Voted
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...