Refine doc for clarity and consistency

Author: Simewu

README.md

@@ -1,14 +1,14 @@
 # Boolean Expression Minimization
 
 ```console
-Canonical form: A standard representation of Boolean expressions used to demonstrate equivalence between different forms.
+Canonical form: A standard representation used to demonstrate equivalence between different forms.
 ```
 
-This browser-based tool simplifies Boolean expressions by converting them into their canonical form. It accepts a JavaScript oracle function, truth table, or DIMACS SAT instance (CNF or DNF) and produces a minimized JavaScript function, truth table, DIMACS CNF or DNF instance, logic circuit diagram, or Karnaugh map.
+This browser-based tool simplifies Boolean expressions by converting them to their canonical form. It accepts a JavaScript oracle function, truth table, or DIMACS SAT instance (DNF or CNF) and produces a minimized JavaScript function, truth table, DIMACS SAT instance, logic circuit diagram, or Karnaugh map.
 
 ![](lib/screenshot.png)
 
-Minimization uses the Quine-McCluskey algorithm, which is NP-complete with exponential time complexity.
+Minimization uses the Quine-McCluskey algorithm, which is NP-complete and runs in exponential time complexity.
 
 ## Logic Circuit Renderer