Robust trainability of single neurons
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Strong bounds on the approximability of two Pspace-hard problems in propositional planning
Annals of Mathematics and Artificial Intelligence
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
Polynomially bounded minimization problems that are hard to approximate
Nordic Journal of Computing
Optimization Problems Categories
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On approximability of linear ordering and related NP-optimization problems on graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Completeness in approximation classes beyond APX
Theoretical Computer Science
Theoretical Computer Science
Local Monotonicity in Probabilistic Networks
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Learning first-order definitions of functions
Journal of Artificial Intelligence Research
The complexity of theory revision
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
The complexity of theory revision
Artificial Intelligence
Approximation classes for real number optimization problems
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Poly-APX- and PTAS-Completeness in standard and differential approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Average-case non-approximability of optimisation problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Survey: A survey on the structure of approximation classes
Computer Science Review
| Hi-index | 0.01 |