Amanote Research

Amanote Research

    RegisterSign In

Long Proofs of (Seemingly) Simple Formulas

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-09284-3_10
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2014

Authors
Mladen MikšaJakob Nordström
Publisher

Springer International Publishing


Related search

Simple Proofs of Bernstein-Type Inequalities

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Option Pricing: Very Simple Formulas

Journal of Derivatives & Hedge Funds
2014English

On Polynomials With Simple Trigonometric Formulas

International Journal of Mathematics and Mathematical Sciences
Mathematics
2004English

Two Simple Proofs of the Feasibility of the Linear Tracing Procedure

Economic Theory
EconomicsEconometrics
2000English

Simple Completeness Proofs for Some Spatial Logics of the Real Line

2013English

Simple Proofs of the Cusa-Huygens-Type and Becker-Stark-Type Inequalities

Journal of Mathematical Inequalities
Analysis
2013English

Constructive Mathematics Is Seemingly Simple but There Are Still Open Problems: Kreisel's Observation Explained

Journal of Innovative Technology and Education
2015English

Application of Simple Formulas to Track Potential in Heavy-Ion-Beam Simulation

Transactions of the Materials Research Society of Japan
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy