Entry Karpinski:1991:AAC from lncs1991.bib
Last update: Sun Jun 12 02:46:39 2016
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Karpinski:1991:AAC,
author = "M. Karpinski",
title = "Approximation Algorithms for Counting Problems in
Finite Fields",
journal = j-LECT-NOTES-COMP-SCI,
volume = "529",
pages = "45--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 08:51:55 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs1991.bib",
acknowledgement = ack-nhfb,
}
Related entries
- Approximation,
473(0)313,
497(0)66,
497(0)474,
507(0)15,
519(0)343,
547(0)281,
560(0)278
- Counting,
505(0)150
- field,
473(0)98,
508(0)222,
508(0)267,
508(0)329,
508(0)354,
511(0)218,
537(0)109,
537(0)616,
539(0)352,
546(0)490,
548(0)262
- finite,
497(0)55,
502(0)33,
508(0)280,
508(0)329,
508(0)354,
510(0)506,
510(0)532,
516(0)100,
520(0)221,
520(0)367,
521(0)173,
528(0)395,
529(0)136,
529(0)287,
531(0)186,
531(0)243,
537(0)109,
539(0)352,
541(0)1,
541(0)17,
567(0)425,
575(0)114
- problem,
496(0)55,
496(0)70,
496(0)98,
496(0)109,
496(0)129,
496(0)188,
496(0)343,
496(0)363,
496(0)430,
496(0)445,
497(0)44,
497(0)66,
497(0)323,
497(0)421,
497(0)455,
497(0)471,
497(0)599,
507(0)111,
508(0)11,
510(0)314,
510(0)556,
510(0)629,
510(0)719,
510(0)751,
511(0)326,
514(0)42,
515(0)1,
519(0)65,
519(0)80,
519(0)105,
519(0)165,
519(0)189,
519(0)240,
519(0)286,
519(0)355,
519(0)392,
519(0)449,
520(0)211,
520(0)259,
520(0)287,
520(0)318,
520(0)337,
520(0)415,
521(0)260,
521(0)298,
521(0)469,
522(0)64,
529(0)68,
529(0)86,
529(0)210,
529(0)258,
529(0)415,
530(0)94,
531(0)1,
531(0)146,
531(0)243,
533(0)95,
535(0)112,
537(0)169,
538(0)1,
543(0)208,
547(0)337,
550(0)512,
553(0)1,
553(0)217,
554(0)1,
555(0)298,
555(0)306,
557(0)22,
557(0)190,
557(0)364,
557(0)375,
560(0)10,
560(0)242,
563(0)63,
565(0)137,
565(0)157,
569(0)39,
575(0)399