2446 search results - page 95 / 490 » Choiceless Polynomial Time |
DIS
2007
Springer
14 years 3 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
CC
2006
Springer
13 years 11 months ago
2006
Springer
We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
WDAG
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
CP
2005
Springer
14 years 4 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...