C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations.
Edoardo Amaldi
Viggo Kann
Published in:
Theor. Comput. Sci. (1995)
Keyphrases
</>
linear complexity
approximation algorithms
background knowledge
semantic relations
artificial neural networks
special case
closed form
linear systems
databases
neural network
multiscale
search algorithm
computational complexity
temporal relations