Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Articles by Topics
Topic F. - Theory of Computation
Topic F.2 - ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
Topic F.2.3 - Tradeoffs between Complexity Measures

H. Hempel:
Randomized Algorithms and Complexity Theory
/jucs_12_6/randomized_algorithms_and_complexity
page 746 - 761
Vol.12 / Issue 6
T. Riege, J. Rothe:
Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem
/jucs_12_6/improving_deterministic_and_randomized
page 725 - 745
Vol.12 / Issue 6
T. Riege, J. Rothe:
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey
/jucs_12_5/completenes_in_the_boolean
page 551 - 578
Vol.12 / Issue 5
A. Vasilieva, R. Freivalds:
Nondeterministic Query Algorithms
/jucs_17_6/nondeterministic_query_algorithms
page 859 - 873
Vol.17 / Issue 6