Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Graphs and Hypergraphs
On the complexity of the containment problem for conjunctive queries with built-in predicates
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of unique solutions
Journal of the ACM (JACM)
The complexity of evaluating relational queries
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
CL '00 Proceedings of the First International Conference on Computational Logic
Data exchange: getting to the core
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the computational complexity of qualitative coalitional games
Artificial Intelligence
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of agent design problems: Determinism and history dependence
Annals of Mathematics and Artificial Intelligence
MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On the Complexity of Semantic Self-minimization
Electronic Notes in Theoretical Computer Science (ENTCS)
Detecting inconsistencies in large biological networks with answer set programming
Theory and Practice of Logic Programming
Boosting minimal unsatisfiable core extraction
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
A framework for coalitional normative systems
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Finding relations among linear constraints
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
On negotiation as concurrency primitive
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
Many important combinatorial optimization problems, including the traveling salesman problem (TSP), the clique problem and many others, call for the optimization of a linear functional over some discrete set of vectors.