Testing extendability for partial chirotopes is np-complete.
Falk TschirschnitzPublished in: CCCG (2001)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- conjunctive queries
- test cases
- polynomially solvable
- pspace complete
- database systems
- website
- objective function
- machine learning
- database
- bounded treewidth
- real time
- data complexity
- software testing
- databases
- statistical tests
- neural network
- phase transition
- constraint satisfaction
- genetic algorithm
- data integration
- learning algorithm
- information systems