Minsik
Discover

Satisfiability problem

More from DIMACS series in discrete mathematics and theoretical computer science
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
724
PAGES
~12h 4min
READING TIME
English
LANGUAGE
Categories
Congresses
Computer Science
Decision Making
Computer Algorithms
American Mathematical Society 4 views
ISBN
0821804790
4 views
Minsik want to read: 0
Minsik reading: 0
Minsik read: 0
Open Library want to read: 0
Open Library reading: 0
Open Library read: 0

About Author

Panos M. Pardalos

Anna Nagurney is an American mathematician, economist, educator and writer in the field of Operations Management. Nagurney is the Eugene M. Isenberg Chair in Integrative Studies in the Isenberg School of Management at the University of Massachusetts Amherst in Amherst, Massachusetts. Previously, she held the John F. Smith Memorial Professorship of Operations Management at the Isenberg School of Management from 1998 to 2021.

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