Arithmetic

Results: 8697



#Item
11Algebra / Abstract algebra / Geometry / Algebraic geometry / Algebraic surfaces / Hodge theory / Analytic number theory / Projective variety / Hodge structure / Elliptic curve / Shimura variety / Algebraic geometry and analytic geometry

Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–452) FUNCTIONAL TRANSCENDENCE AND ARITHMETIC APPLICATIONS Jacob Tsimerman

Add to Reading List

Source URL: eta.impa.br

Language: English - Date: 2018-07-25 13:17:43
12Theoretical computer science / Mathematics / Mathematical logic / Logic in computer science / Boolean algebra / Electronic design automation / Formal methods / NP-complete problems / Solver / Propositional calculus / AMPL / Modulo operation

SAT modulo the theory of linear arithmetic: Exact, inexact and commercial solvers Germain Faure, Robert Nieuwenhuis, Albert Oliveras and Enric Rodr´ıguez-Carbonell 11th International Conference, SAT 2008

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2008-05-19 09:02:24
13Cryptography / Computational complexity theory / Complexity classes / Randomized algorithms / Zero-knowledge proof / Analysis of algorithms / NP / Commitment scheme / Probabilistically checkable proof / IP / Logarithm / XTR

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting†∗ Jonathan Bootle1 , Andrea Cerulli1 , Pyrros Chaidos1∗∗ , Jens Groth1 , and Christophe Petit2 1

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2016-03-08 12:29:47
14Mathematics / Number theory / Elliptic curves / Discrete mathematics / Analytic number theory / Conjectures / Rank of an elliptic curve / TateShafarevich group / Elliptic curve cryptography / Elliptic curve / Birch and Swinnerton-Dyer conjecture / Rational point

Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–412) HEURISTICS FOR THE ARITHMETIC OF ELLIPTIC CURVES Bjorn Poonen

Add to Reading List

Source URL: eta.impa.br

Language: English - Date: 2018-07-25 13:17:43
15Mathematics / Computer arithmetic / Algebra / Abstract algebra / Abstract interpretation / Interval arithmetic / Two's complement / Interval / Signedness / Logarithm / Modular arithmetic / Division by zero

1 Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss GRAEME GANGE, JORGE A. NAVAS, PETER SCHACHTE, HARALD SØNDERGAARD, and PETER J. STUCKEY, The University of Melbourne, Australia

Add to Reading List

Source URL: jorgenavas.github.io

Language: English - Date: 2018-10-25 12:43:22
16Theoretical computer science / Mathematics / Computational complexity theory / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean algebra / Satisfiability modulo theories / Boolean satisfiability problem / Linear programming / AMPL

SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers Germain Faure, Robert Nieuwenhuis, Albert Oliveras and Enric Rodr´ıguez-Carbonell? Abstract. Many highly sophisticated tools exist for

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2008-05-08 10:37:46
17Computer arithmetic / Arithmetic / Mathematics / Computer architecture / Rounding / IEEE 754 / Double-precision floating-point format / Interval arithmetic / Significant figures / NaN / Sine / Signed zero

Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic David Defour Guillaume Hanrot Jean-Michel Muller

Add to Reading List

Source URL: perso.ens-lyon.fr

Language: English - Date: 2005-01-20 09:50:18
18Computer arithmetic / cole normale suprieure de Lyon / Floating-point arithmetic

Introduction Taylor model arithmetic using floating-point arithmetic Getting even more accuracy Conclusion Diddl - Goletz

Add to Reading List

Source URL: perso.ens-lyon.fr

Language: English - Date: 2007-07-27 03:54:27
19Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Satisfiability modulo theories / Boolean algebra / Local consistency

Solving Nonlinear Integer Arithmetic with MCSAT? Dejan Jovanovi´c SRI International Abstract. We present a new method for solving nonlinear integer arithmetic constraints. The method relies on the MCSat approach to sol

Add to Reading List

Source URL: csl.sri.com

Language: English - Date: 2016-11-28 15:21:09
20Mathematics / Algebra / Polynomials / Probabilistically checkable proof / Computer algebra / IP / Complex number / MAX-3SAT

COSC 544 Probabilistic Proof SystemsA PCP of Quasilinear Size for Arithmetic Circuit-SAT Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Language: English - Date: 2017-11-22 13:48:36
UPDATE