900 search results - page 21 / 180 » On Polynomial Time Computation over Unordered Structures |
WCE
2007
15 years 3 months ago
2007
— A form of Gauss-Quadrature rule over [0,1] has been investigated that involves the derivative of the integrand at the pre-assigned left or right end node. This situation arises...
175
click to vote
ECCC
2011
14 years 9 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
124
click to vote
LICS
2005
IEEE
15 years 7 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
124
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
CHI
2010
ACM
15 years 8 months ago
2010
ACM
Information overload is a growing threat to the productivity of today’s knowledge workers, who need to keep track of multiple streams of information from various sources. RSS fe...