Search dblp for Publications

export results for "ideal upper bound"

 download as .bib file

@article{DBLP:journals/jsc/HashemiS20,
  author       = {Amir Hashemi and
                  Werner M. Seiler},
  title        = {Dimension and depth dependent upper bounds in polynomial ideal theory},
  journal      = {J. Symb. Comput.},
  volume       = {98},
  pages        = {47--64},
  year         = {2020}
}
@article{DBLP:journals/combinatorics/Fakhari19,
  author       = {Seyed Amin Seyed Fakhari},
  title        = {An Upper Bound for the Regularity of Symbolic Powers of Edge Ideals
                  of Chordal Graphs},
  journal      = {Electron. J. Comb.},
  volume       = {26},
  number       = {2},
  pages        = {2},
  year         = {2019}
}
@inproceedings{DBLP:conf/dlt/BrzozowskiS14,
  author       = {Janusz A. Brzozowski and
                  Marek Szykula},
  title        = {Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals},
  booktitle    = {Developments in Language Theory},
  series       = {Lecture Notes in Computer Science},
  volume       = {8633},
  pages        = {13--24},
  publisher    = {Springer},
  year         = {2014}
}
@article{DBLP:journals/corr/BrzozowskiS14a,
  author       = {Janusz A. Brzozowski and
                  Marek Szykula},
  title        = {Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals},
  journal      = {CoRR},
  volume       = {abs/1403.2090},
  year         = {2014}
}
@article{DBLP:journals/apal/BarmpaliasN11,
  author       = {George Barmpalias and
                  Andr{\'{e}} Nies},
  title        = {Upper bounds on ideals in the computably enumerable Turing degrees},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {162},
  number       = {6},
  pages        = {465--473},
  year         = {2011}
}
@article{DBLP:journals/jsyml/KuceraS09,
  author       = {Anton{\'{\i}}n Kucera and
                  Theodore A. Slaman},
  title        = {Low upper bounds of ideals},
  journal      = {J. Symb. Log.},
  volume       = {74},
  number       = {2},
  pages        = {517--534},
  year         = {2009}
}
@inproceedings{DBLP:conf/icassp/NeuhoffP06,
  author       = {David L. Neuhoff and
                  S. Sandeep Pradhan},
  title        = {An Upper Bound to the Rate of Ideal Distributed Lossy Source Coding
                  of Densely Sampled Data},
  booktitle    = {{ICASSP} {(5)}},
  pages        = {1137--1140},
  publisher    = {{IEEE}},
  year         = {2006}
}
@inproceedings{DBLP:conf/ideal/WatanabeSW06,
  author       = {Kazuho Watanabe and
                  Motoki Shiga and
                  Sumio Watanabe},
  title        = {Upper Bounds for Variational Stochastic Complexities of Bayesian Networks},
  booktitle    = {{IDEAL}},
  series       = {Lecture Notes in Computer Science},
  volume       = {4224},
  pages        = {139--146},
  publisher    = {Springer},
  year         = {2006}
}
@article{DBLP:journals/orl/GoldbergS99,
  author       = {Robert R. Goldberg and
                  Jacob Shapiro},
  title        = {A tight upper bound for the \emph{k}-partition problem on ideal sets},
  journal      = {Oper. Res. Lett.},
  volume       = {24},
  number       = {4},
  pages        = {165--173},
  year         = {1999}
}
@article{DBLP:journals/jsc/Lazard92a,
  author       = {Daniel Lazard},
  title        = {A Note on Upper Bounds for Ideal-Theoretic Problems},
  journal      = {J. Symb. Comput.},
  volume       = {13},
  number       = {3},
  pages        = {231--234},
  year         = {1992}
}
@article{DBLP:journals/jsyml/Hodes83,
  author       = {Harold T. Hodes},
  title        = {More About Uniform Upper Bounds on Ideals of Turing Degrees},
  journal      = {J. Symb. Log.},
  volume       = {48},
  number       = {2},
  pages        = {441--457},
  year         = {1983}
}
@article{DBLP:journals/jsyml/Hodes78,
  author       = {Harold T. Hodes},
  title        = {Uniform Upper Bounds on Ideals of Turing Degrees},
  journal      = {J. Symb. Log.},
  volume       = {43},
  number       = {3},
  pages        = {601--612},
  year         = {1978}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics