Login / Signup
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.
Olivier Bournez
Felipe Cucker
Paulin Jacobé de Naurois
Jean-Yves Marion
Published in:
J. Log. Comput. (2005)
Keyphrases
</>
worst case
computational complexity
special case
data sets
neural network
decision problems
parallel version
database
case study
hierarchical structure
approximation algorithms
structural properties
parallel implementation
polynomial hierarchy