Global minimization of nonconvex energy functions
Graphs and discovery
Mathematical methods of analysis of biopolymer sequences
Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
Contemporary trends in discrete mathematics
Network flows and matching
Satisfiability problem
Quadratic assignment and related problems
Parallel processing of discrete optimization problems
Randomization methods in algorithm design
Global minimization of nonconvex energy functions
Minsik readers
0.0
0 ratings
Other platforms
0.0
0 ratings
271
PAGES~4h 31min
READING TIMEEnglish
LANGUAGE Categories
Description
There is no description yet, we will add it soon.
Detailed Ratings
0.0Emotional Impact
No ratings yet
0.0Intellectual Depth
No ratings yet
0.0Writing Quality
No ratings yet
0.0Rereadability
No ratings yet
0.0Pacing
No ratings yet
0.0Readability
No ratings yet
0.0Plot Complexity
No ratings yet
0.0Humor
No ratings yet
