111 search results - page 13 / 23 » Third-Order Computation and Bounded Arithmetic |
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
COMPGEOM
2003
ACM
14 years 22 days ago
2003
ACM
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...
PPOPP
1999
ACM
13 years 11 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
JSC
2000
13 years 7 months ago
2000
We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and a bound o...