Entry Arora:1992:PVH from focs1990.bib
Last update: Thu Sep 27 02:15:07 MDT 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@InProceedings{Arora:1992:PVH,
author = "S. Arora and C. Lund and R. Motwani and M. Sudan and
Mario Szegedy",
title = "Proof verification and hardness of approximation
problems",
crossref = "IEEE:1992:ASF",
pages = "14--23",
year = "1992",
bibdate = "Thu Apr 5 06:13:50 MDT 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/focs1990.bib",
acknowledgement = ack-nhfb,
}
Related entries
- approximation,
0(0)2,
0(0)2,
0(0)12,
0(0)24,
0(0)32,
0(0)62,
0(0)82,
0(0)154,
0(0)162,
0(0)184,
0(0)227,
0(0)244,
0(0)302,
0(0)310,
0(0)320,
0(0)322,
0(0)339,
0(0)370,
0(0)406,
0(0)416,
0(0)426,
0(0)431,
0(0)448,
0(0)459,
0(0)468,
0(0)495,
0(0)536,
0(0)547,
0(0)548,
0(0)554,
0(0)617,
0(0)640,
0(0)662,
0(0)711,
2(0)726
- Arora, S.,
0(0)2,
0(0)2,
0(0)21,
0(0)404,
0(0)554,
0(0)724
- cut,
0(0)92,
0(0)399,
0(0)548,
0(0)743
- field,
0(0)45,
0(0)56,
0(0)108,
0(0)202,
0(0)269,
0(0)284,
0(0)384,
0(0)616
- finding,
0(0)154,
0(0)284,
0(0)319,
0(0)370,
0(0)480,
0(0)560,
0(0)596,
0(0)674,
0(0)743,
2(0)778
- Garg, N.,
0(0)290,
0(0)300,
0(0)302
- graph,
0(0)2,
0(0)21,
0(0)24,
0(0)50,
0(0)52,
0(0)60,
0(0)70,
0(0)75,
0(0)84,
0(0)86,
0(0)94,
0(0)96,
0(0)101,
0(0)118,
0(0)120,
0(0)194,
0(0)204,
0(0)210,
0(0)218,
0(0)259,
0(0)288,
0(0)296,
0(0)319,
0(0)330,
0(0)396,
0(0)398,
0(0)399,
0(0)453,
0(0)463,
0(0)480,
0(0)496,
0(0)511,
0(0)538,
0(0)577,
0(0)583,
0(0)605,
0(0)614,
0(0)640,
0(0)656,
0(0)674,
0(0)680,
0(0)693,
0(0)723,
0(0)744,
0(0)780,
0(0)793,
1(0)86,
1(0)355,
1(0)429,
1(0)439,
2(0)464,
2(0)470,
2(0)689,
2(0)708
- hardness,
0(0)181,
0(0)414,
0(0)465,
0(0)475,
0(0)724,
1(0)318
- Kleinberg, J.,
0(0)86,
0(0)353,
0(0)380,
0(0)568
- labeling,
0(0)320
- Lund, C.,
0(0)424,
1(0)2,
1(0)16
- Markov,
0(0)150,
0(0)208,
0(0)213,
0(0)218,
0(0)223,
0(0)436,
0(0)656,
0(0)694,
1(0)346
- metric,
0(0)2,
0(0)62,
0(0)154,
0(0)171,
0(0)184,
0(0)379,
0(0)468
- Motwani, R.,
0(0)2,
0(0)353,
0(0)592,
0(0)819
- optimal,
0(0)29,
0(0)78,
0(0)121,
0(0)137,
0(0)142,
0(0)264,
0(0)266,
0(0)332,
0(0)369,
0(0)440,
0(0)480,
0(0)512,
0(0)515,
0(0)544,
0(0)560,
0(0)593,
0(0)604,
0(0)743,
0(0)770
- planar,
0(0)92,
0(0)96,
0(0)100,
0(0)101,
0(0)118,
0(0)150,
0(0)156,
0(0)178,
0(0)259,
0(0)319,
0(0)437,
0(0)557,
0(0)583,
0(0)640,
0(0)723,
0(0)802,
1(0)96
- problem,
0(0)2,
0(0)2,
0(0)12,
0(0)21,
0(0)40,
0(0)72,
0(0)78,
0(0)82,
0(0)110,
0(0)123,
0(0)130,
0(0)135,
0(0)140,
0(0)160,
0(0)166,
0(0)172,
0(0)177,
0(0)186,
0(0)192,
0(0)197,
0(0)214,
0(0)218,
0(0)284,
0(0)290,
0(0)299,
0(0)300,
0(0)310,
0(0)314,
0(0)322,
0(0)344,
0(0)354,
0(0)378,
0(0)378,
0(0)382,
0(0)410,
0(0)416,
0(0)422,
0(0)426,
0(0)438,
0(0)444,
0(0)448,
0(0)449,
0(0)458,
0(0)464,
0(0)465,
0(0)468,
0(0)470,
0(0)473,
0(0)495,
0(0)521,
0(0)524,
0(0)534,
0(0)538,
0(0)540,
0(0)548,
0(0)550,
0(0)554,
0(0)556,
0(0)575,
0(0)576,
0(0)579,
0(0)581,
0(0)612,
0(0)621,
0(0)622,
0(0)626,
0(0)638,
0(0)653,
0(0)670,
0(0)678,
0(0)780,
1(0)173,
2(0)583,
2(0)662,
2(0)802
- proof,
0(0)2,
0(0)18,
0(0)19,
0(0)26,
0(0)112,
0(0)254,
0(0)422,
0(0)427,
0(0)436,
0(0)466,
0(0)486,
0(0)638,
0(0)648,
0(0)794,
1(0)2,
1(0)308,
2(0)563
- random,
0(0)79,
0(0)84,
0(0)120,
0(0)204,
0(0)230,
0(0)264,
0(0)264,
0(0)369,
0(0)389,
0(0)415,
0(0)463,
0(0)508,
0(0)533,
0(0)558,
0(0)586,
0(0)616,
0(0)680,
1(0)308,
2(0)534,
2(0)544,
2(0)689,
2(0)812
- relationships,
0(0)372
- Saran, H.,
0(0)144,
0(0)743
- separator,
0(0)232,
0(0)538
- Sudan, M.,
0(0)2,
0(0)8,
0(0)18,
0(0)28,
0(0)41,
0(0)164,
0(0)294,
0(0)422,
0(0)432,
0(0)475,
0(0)503,
0(0)511,
0(0)604,
0(0)617,
0(0)819
- Tardos, E.,
0(0)52,
0(0)495,
0(0)568
- twice,
0(0)743
- Vazirani, V. V.,
0(0)2,
0(0)144,
0(0)322,
0(0)743