scientific article; zbMATH DE number 7753415

MaRDI QIDQ6076229

Klaus Meer

Publication date: 23 October 2023

Full work available at URL: http://yokohamapublishers.jp/online2/oppafa/vol8/p1135.html

Title of this publication is not available (Why is that?)

zbMATH Keywords

probabilistically checkable proofsreal number computationsreal number PCP theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computation over the reals, computable analysis (03D78)

Recommendations

• Proof verification and the hardness of approximation problems 👍 👎
• Proof Complexity Meets Algebra 👍 👎
• Proof Complexity 👍 👎
• Proof complexity meets algebra 👍 👎
• Approximability and proof complexity 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076229)