A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic
0 sources
A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic
Summary
A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic is a doctoral thesis[1].
Key Facts
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic authored Vincent Liew[2].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's instance of is recorded as doctoral thesis[3].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's OCLC number is recorded as 1246318987[4].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's language of work or name is recorded as English[5].
- +2020-00-00T00:00:00Z marks the founding of A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic[6].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's work available at URL is recorded as http://hdl.handle.net/1773/46423[7].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's number of pages is recorded as {'unit': 'http://www.wikidata.org/entity/Q1069725', 'amount': '+174'}[8].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's number of pages is recorded as {'unit': 'http://www.wikidata.org/entity/Q56761382', 'amount': '+8'}[9].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's Handle ID is recorded as 1773/46423[10].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's title is recorded as A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic[11].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's thesis submitted to is recorded as University of Washington[12].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's on focus list of Wikimedia project is recorded as WikiProject PCC Wikidata Pilot/University of Washington[13].
- A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's thesis committee member is recorded as Paul William Beame[14].
Body
Designation and Status
A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic's instance of is recorded as doctoral thesis[3].
History and Context
+2020-00-00T00:00:00Z marks the founding of A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic[6].