Sciweavers

33 search results - page 2 / 7
» Set-theoretic solutions of the Yang-Baxter equation, graphs ...
Sort
View
RTA
1991
Springer
13 years 11 months ago
Narrowing Directed by a Graph of Terms
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
Jacques Chabin, Pierre Réty
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
14 years 2 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
ISPAN
2002
IEEE
14 years 8 days ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 7 months ago
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...
SCAM
2008
IEEE
14 years 1 months ago
User-Input Dependence Analysis via Graph Reachability
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
Bernhard Scholz, Chenyi Zhang, Cristina Cifuentes