Sciweavers

4966 search results - page 78 / 994
» its 2010
Sort
View
DM
2010
107views more  DM 2010»
15 years 6 months ago
Degree-associated reconstruction number of graphs
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of...
Michael D. Barrus, Douglas B. West
DM
2010
135views more  DM 2010»
15 years 6 months ago
On convexification of polygons by pops
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, a...
Adrian Dumitrescu, Evan Hilscher
ENTCS
2010
91views more  ENTCS 2010»
15 years 6 months ago
A Unified Display Proof Theory for Bunched Logic
We formulate a unified display calculus proof theory for the four principal varieties of bunched logic by combining display calculi for their component logics. Our calculi satisfy...
James Brotherston
DT
2006
113views more  DT 2006»
15 years 6 months ago
The Challenges of Synthesizing Hardware from C-Like Languages
at their abstractions are similar to data types and operations supplied by conventional processors. A core principle of BCPL is its memory model: an The Challenges of Synthesizing ...
Stephen A. Edwards
ECCC
2006
93views more  ECCC 2006»
15 years 6 months ago
On the Deduction Theorem and Complete Disjoint NP-Pairs
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
Olaf Beyersdorff