148 search results - page 20 / 30 » An Algebraic Theory of Graph Reduction |
JSYML
2010
13 years 5 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
PLDI
2004
ACM
14 years 24 days ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
CIIA
2009
13 years 8 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— A novel, practical and low-complexity multi-cell OFDMA downlink channel assignment method using a graphbased approach is proposed in this work. The inter-cell interference (ICI...