Graph Ramsey theory and the polynomial hierarchy
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SIGACT news complexity theory comun 37
ACM SIGACT News
SIGACT news complexity theory column 38
ACM SIGACT News
On the Complexity and Inapproximability of Shortest Implicant Problems
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Redundancy in logic II: 2CNF and Horn propositional formulae
Artificial Intelligence
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
The complexity of Boolean formula minimization
Journal of Computer and System Sciences
Design of fuzzy rule-based classifiers with semantic cointension
Information Sciences: an International Journal
Optimization problems in the polynomial-time hierarchy
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Hi-index | 0.00 |
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual are capacities. Our approach leads to an O(min(n/sup 2/3/, m/sup 1/2/)m log(n/sup 2//m) log U) ...