SIGACT news complexity theory comun 37
ACM SIGACT News
SIGACT news complexity theory column 38
ACM SIGACT News
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An incremental algorithm for DLO quantifier elimination via constraint propagation
Artificial Intelligence
Schema polynomials and applications
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
On approximate horn formula minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The complexity of Boolean formula minimization
Journal of Computer and System Sciences
The bacterial strains characterization problem
Proceedings of the 2011 ACM Symposium on Applied Computing
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics
Optimization problems in the polynomial-time hierarchy
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Complexity of DNF and isomorphism of monotone formulas
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Approximate boolean reasoning: foundations and applications in data mining
Transactions on Rough Sets V
Minimum multiple characterization of biological data using partially defined boolean formulas
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Towards efficient implementation of packet classifiers in SDN/OpenFlow
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Boolean functions with long prime implicants
Information Processing Letters
A decomposition method for CNF minimality proofs
Theoretical Computer Science
Hi-index | 0.00 |