scientific article; zbMATH DE number 7566049

MaRDI QIDQ5094121

Tobias Nipkow, Robin Eßmann, Ujkan Sulejmani, Simon Robillard

Publication date: 2 August 2022

Full work available at URL: https://arxiv.org/abs/2104.13851

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Greed is good: Approximating independent sets in sparse and bounded-degree graphs
• A linear approximation algorithm for bin packing with absolute approximation factor \(\frac {3}{2}\)
• Isabelle/HOL. A proof assistant for higher-order logic
• Towards formal foundations for game theory
• Verifying an incremental theory solver for linear arithmetic in Isabelle/HOL
• Concrete Semantics
• Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
• Verified Approximation Algorithms
• Logic Based Program Synthesis and Transformation
• Cardinality of relations and relational approximation algorithms

This page was built for publication: