Proof verification and the hardness of approximation problems
about
Components in time-varying graphs.Computational complexity in electronic structure.Markov entropy decomposition: a variational dual for quantum belief propagation.Preparing ground States of quantum many-body systems on a quantum computer.Mathematics: proof at a roll of the dice.On the hardness of approximating minimum vertex coverSatisfying Degree-d Equations over GF[2] nOn the advantage over a random assignmentSimple analysis of graph tests for linearity and PCPAPPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARDVertex cover might be hard to approximate to within 2-ε
P2860
Q43807223-55CE0EE3-B22D-469A-944F-A34F96D7D872Q44835513-BD39C065-6426-4DFE-AE05-6BA491DED13CQ51592162-4AA9075A-4C9D-48FE-8AA3-DCE22B576F67Q51836884-FC58879E-DF53-46EB-913D-0DF8C9CE7ABBQ51926350-2A69AE27-2524-48E9-B100-434460C91FE5Q56338020-3583E23B-7AB1-410B-ADB0-6B684DD1FE6DQ56958844-5D0577D7-A0C1-4A9A-9241-137B83546F44Q56958935-2688A4C8-FD46-44BA-84F1-DA2D3CF8CF50Q56958974-955D08FF-8D83-4FA8-9E0D-D274BA3C336AQ57518638-1E465C8E-FAF5-471C-8C0B-0BB0494EEA99Q94993767-240c48cf-4ca0-4ddb-4eec-c7208c70a62e
P2860
Proof verification and the hardness of approximation problems
description
im Mai 1998 veröffentlichter wissenschaftlicher Artikel
@de
journal article published in 1998
@en
wetenschappelijk artikel
@nl
наукова стаття, опублікована в травні 1998
@uk
name
Proof verification and the hardness of approximation problems
@en
Proof verification and the hardness of approximation problems
@nl
type
label
Proof verification and the hardness of approximation problems
@en
Proof verification and the hardness of approximation problems
@nl
prefLabel
Proof verification and the hardness of approximation problems
@en
Proof verification and the hardness of approximation problems
@nl
P2860
P50
P356
P1433
P1476
Proof verification and the hardness of approximation problems
@en
P2860
P304
P356
10.1145/278298.278306
P407
P577
1998-05-01T00:00:00Z
P5875
P894
1065.68570