Results 1 to 10 of about 25,305 (197)
Two inequalities about the pedal triangle
Journal of Inequalities and Applications, 2018 Two conjectures about the pedal triangle are proved. For the first conjecture, the product of the distances from an interior point to the vertices is mainly considered and a lower bound is obtained by the geometric method.
Fangjian Huang
doaj +1 more source
Some Refinements and Generalizations of I. Schur Type Inequalities
The Scientific World Journal, 2014 Recently, extensive researches on estimating the value of e have been studied. In this paper, the structural characteristics of I. Schur type inequalities are exploited to generalize the corresponding inequalities by variable parameter techniques.
Xian-Ming Gu +5 more
doaj +1 more source
Computer-Aided Verification of P/NP Proofs: A Survey and Discussion
IEEE AccessWe survey a collection of proofs towards equality, inequality, or independence of the relation of P to NP. Since the problem has attracted much attention from experts, amateurs, and in-betweens, this work is intended as a pointer into directions to ...
Stefan Rass +3 more
doaj +1 more source
Extensions to the Estimation Calculus [PDF]
, 1999 Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-foundedness of induction rules.
Bundy, Alan, Gow, Jeremy, Green, Ian
core +5 more sources
The natural algorithmic approach of mixed trigonometric-polynomial problems [PDF]
, 2017 The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to analyze some new ...
Lutovac, Tatjana +2 more
core +3 more sources
Speeding up the constraint-based method in difference logic [PDF]
, 2016 "The final publication is available at http://link.springer.com/chapter/10.1007%2F978-3-319-40970-2_18"Over the years the constraint-based method has been successfully applied to a wide range of problems in program analysis, from invariant generation to ...
A Miné +26 more
core +1 more source
Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time [PDF]
, 2019 The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the program input result in proportional changes to the program output. For probabilistic programs the notion is naturally extended to expected sensitivity. A previous
Chatterjee, Krishnendu +4 more
core +4 more sources
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem [PDF]
, 2016 The cryptogenography problem, introduced by Brody, Jakobsen, Scheder, and Winkler (ITCS 2014), is to collaboratively leak a piece of information known to only one member of a group (i)~without revealing who was the origin of this information and (ii ...
Doerr, Benjamin, Künnemann, Marvin
core +2 more sources
Formal Proofs for Nonlinear Optimization [PDF]
, 2015 We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified lower bound of
Allamigeon, Xavier +3 more
core +4 more sources
, 2018 We used computer proof-checking methods to verify the correctness of our proofs of the propositions in Euclid Book I. We used axioms as close as possible to those of Euclid, in a language closely related to that used in Tarski's formal geometry.
Beeson, Michael +2 more
core +3 more sources