Atıf Formatları
A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs
  • IEEE
  • ACM
  • APA
  • Chicago
  • MLA
  • Harvard
  • BibTeX

E. Ş. Yazıcı And E. Kolotoğlu, "A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs," 21st British Combinatorial Conference , Reading, United Kingdom, pp.68, 2007

Yazıcı, E. Ş. And Kolotoğlu, E. 2007. A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs. 21st British Combinatorial Conference , (Reading, United Kingdom), 68.

Yazıcı, E. Ş., & Kolotoğlu, E., (2007). A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs . 21st British Combinatorial Conference (pp.68). Reading, United Kingdom

Yazıcı, Emine, And Emre KOLOTOĞLU. "A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs," 21st British Combinatorial Conference, Reading, United Kingdom, 2007

Yazıcı, Emine Ş. And Kolotoğlu, Emre. "A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs." 21st British Combinatorial Conference , Reading, United Kingdom, pp.68, 2007

Yazıcı, E. Ş. And Kolotoğlu, E. (2007) . "A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs." 21st British Combinatorial Conference , Reading, United Kingdom, p.68.

@conferencepaper{conferencepaper, author={Emine Şule Yazıcı And author={Emre KOLOTOĞLU}, title={A new Algorithm for Finding the Full Set of Minimal Defining Sets of Full Designs}, congress name={21st British Combinatorial Conference}, city={Reading}, country={United Kingdom}, year={2007}, pages={68} }