Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Algebra Boolean ). Showing records 1 – 30 of 91 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Levels

▼ Search Limiters


Portland State University

1. Schimanski, Nichole Louise. Orthomorphisms of Boolean Groups.

Degree: PhD, Mathematics and Statistics, 2016, Portland State University

  An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x + π(x)… (more)

Subjects/Keywords: Boolean algebra; Permutation groups; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schimanski, N. L. (2016). Orthomorphisms of Boolean Groups. (Doctoral Dissertation). Portland State University. Retrieved from http://pdxscholar.library.pdx.edu/open_access_etds/3100

Chicago Manual of Style (16th Edition):

Schimanski, Nichole Louise. “Orthomorphisms of Boolean Groups.” 2016. Doctoral Dissertation, Portland State University. Accessed August 09, 2020. http://pdxscholar.library.pdx.edu/open_access_etds/3100.

MLA Handbook (7th Edition):

Schimanski, Nichole Louise. “Orthomorphisms of Boolean Groups.” 2016. Web. 09 Aug 2020.

Vancouver:

Schimanski NL. Orthomorphisms of Boolean Groups. [Internet] [Doctoral dissertation]. Portland State University; 2016. [cited 2020 Aug 09]. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/3100.

Council of Science Editors:

Schimanski NL. Orthomorphisms of Boolean Groups. [Doctoral Dissertation]. Portland State University; 2016. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/3100


Oregon State University

2. Driessel, Kenneth Richard. Circuit algebras and some of their properties.

Degree: MS, Mathematics, 1965, Oregon State University

 It is well known that two-terminal switching circuits may be represented by boolean formulas. Thus the study of certain switching circuit problems leads to the… (more)

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Driessel, K. R. (1965). Circuit algebras and some of their properties. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/48145

Chicago Manual of Style (16th Edition):

Driessel, Kenneth Richard. “Circuit algebras and some of their properties.” 1965. Masters Thesis, Oregon State University. Accessed August 09, 2020. http://hdl.handle.net/1957/48145.

MLA Handbook (7th Edition):

Driessel, Kenneth Richard. “Circuit algebras and some of their properties.” 1965. Web. 09 Aug 2020.

Vancouver:

Driessel KR. Circuit algebras and some of their properties. [Internet] [Masters thesis]. Oregon State University; 1965. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/1957/48145.

Council of Science Editors:

Driessel KR. Circuit algebras and some of their properties. [Masters Thesis]. Oregon State University; 1965. Available from: http://hdl.handle.net/1957/48145


Oregon State University

3. Dixon, Oren Wesley. On the simplification of Boolean polynomials.

Degree: MS, Mathematics, 1962, Oregon State University

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dixon, O. W. (1962). On the simplification of Boolean polynomials. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/49017

Chicago Manual of Style (16th Edition):

Dixon, Oren Wesley. “On the simplification of Boolean polynomials.” 1962. Masters Thesis, Oregon State University. Accessed August 09, 2020. http://hdl.handle.net/1957/49017.

MLA Handbook (7th Edition):

Dixon, Oren Wesley. “On the simplification of Boolean polynomials.” 1962. Web. 09 Aug 2020.

Vancouver:

Dixon OW. On the simplification of Boolean polynomials. [Internet] [Masters thesis]. Oregon State University; 1962. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/1957/49017.

Council of Science Editors:

Dixon OW. On the simplification of Boolean polynomials. [Masters Thesis]. Oregon State University; 1962. Available from: http://hdl.handle.net/1957/49017


Oregon State University

4. Toms, Ralph Marvin. On systems of Boolean equations.

Degree: MS, Mathematics, 1961, Oregon State University

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Toms, R. M. (1961). On systems of Boolean equations. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/50066

Chicago Manual of Style (16th Edition):

Toms, Ralph Marvin. “On systems of Boolean equations.” 1961. Masters Thesis, Oregon State University. Accessed August 09, 2020. http://hdl.handle.net/1957/50066.

MLA Handbook (7th Edition):

Toms, Ralph Marvin. “On systems of Boolean equations.” 1961. Web. 09 Aug 2020.

Vancouver:

Toms RM. On systems of Boolean equations. [Internet] [Masters thesis]. Oregon State University; 1961. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/1957/50066.

Council of Science Editors:

Toms RM. On systems of Boolean equations. [Masters Thesis]. Oregon State University; 1961. Available from: http://hdl.handle.net/1957/50066


Oregon State University

5. Laxdal, Albert Lee. A mechanization of Quine's canonical form.

Degree: MS, Mathematics, 1959, Oregon State University

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Laxdal, A. L. (1959). A mechanization of Quine's canonical form. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/50177

Chicago Manual of Style (16th Edition):

Laxdal, Albert Lee. “A mechanization of Quine's canonical form.” 1959. Masters Thesis, Oregon State University. Accessed August 09, 2020. http://hdl.handle.net/1957/50177.

MLA Handbook (7th Edition):

Laxdal, Albert Lee. “A mechanization of Quine's canonical form.” 1959. Web. 09 Aug 2020.

Vancouver:

Laxdal AL. A mechanization of Quine's canonical form. [Internet] [Masters thesis]. Oregon State University; 1959. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/1957/50177.

Council of Science Editors:

Laxdal AL. A mechanization of Quine's canonical form. [Masters Thesis]. Oregon State University; 1959. Available from: http://hdl.handle.net/1957/50177


Rutgers University

6. Gruber, Aritanan G., 1974-. Algorithmic and complexity results for boolean and pseudo-boolean functions.

Degree: PhD, Operations Research, 2015, Rutgers University

This dissertation presents our contributions to two problems. In the first problem, we study the hardness of approximation of clause minimum and literal minimum representations… (more)

Subjects/Keywords: Algebra, Boolean; Algebraic functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gruber, Aritanan G., 1. (2015). Algorithmic and complexity results for boolean and pseudo-boolean functions. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46349/

Chicago Manual of Style (16th Edition):

Gruber, Aritanan G., 1974-. “Algorithmic and complexity results for boolean and pseudo-boolean functions.” 2015. Doctoral Dissertation, Rutgers University. Accessed August 09, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/46349/.

MLA Handbook (7th Edition):

Gruber, Aritanan G., 1974-. “Algorithmic and complexity results for boolean and pseudo-boolean functions.” 2015. Web. 09 Aug 2020.

Vancouver:

Gruber, Aritanan G. 1. Algorithmic and complexity results for boolean and pseudo-boolean functions. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Aug 09]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46349/.

Council of Science Editors:

Gruber, Aritanan G. 1. Algorithmic and complexity results for boolean and pseudo-boolean functions. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46349/


Michigan State University

7. Zhang, Ping. Subposets of the boolean algebra.

Degree: PhD, Department of Mathematics, 1994, Michigan State University

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhang, P. (1994). Subposets of the boolean algebra. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:29845

Chicago Manual of Style (16th Edition):

Zhang, Ping. “Subposets of the boolean algebra.” 1994. Doctoral Dissertation, Michigan State University. Accessed August 09, 2020. http://etd.lib.msu.edu/islandora/object/etd:29845.

MLA Handbook (7th Edition):

Zhang, Ping. “Subposets of the boolean algebra.” 1994. Web. 09 Aug 2020.

Vancouver:

Zhang P. Subposets of the boolean algebra. [Internet] [Doctoral dissertation]. Michigan State University; 1994. [cited 2020 Aug 09]. Available from: http://etd.lib.msu.edu/islandora/object/etd:29845.

Council of Science Editors:

Zhang P. Subposets of the boolean algebra. [Doctoral Dissertation]. Michigan State University; 1994. Available from: http://etd.lib.msu.edu/islandora/object/etd:29845


University of Victoria

8. Lui, Patrick Kam. Simplified theory of Boolean functions.

Degree: Department of Computer Science, 2018, University of Victoria

 A new, intuitive approach to the study of a Boolean function using its set of parities of subfunctions called the parity spectrum is presented. This… (more)

Subjects/Keywords: Computer science; Mathematics; Algebra, Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lui, P. K. (2018). Simplified theory of Boolean functions. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9500

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lui, Patrick Kam. “Simplified theory of Boolean functions.” 2018. Thesis, University of Victoria. Accessed August 09, 2020. https://dspace.library.uvic.ca//handle/1828/9500.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lui, Patrick Kam. “Simplified theory of Boolean functions.” 2018. Web. 09 Aug 2020.

Vancouver:

Lui PK. Simplified theory of Boolean functions. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Aug 09]. Available from: https://dspace.library.uvic.ca//handle/1828/9500.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lui PK. Simplified theory of Boolean functions. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9500

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Arizona

9. Mobley, Charles Lee, 1920-. Matric representation of Boolean algebras .

Degree: 1947, University of Arizona

Subjects/Keywords: Algebra; Boolean.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mobley, Charles Lee, 1. (1947). Matric representation of Boolean algebras . (Masters Thesis). University of Arizona. Retrieved from http://hdl.handle.net/10150/319175

Chicago Manual of Style (16th Edition):

Mobley, Charles Lee, 1920-. “Matric representation of Boolean algebras .” 1947. Masters Thesis, University of Arizona. Accessed August 09, 2020. http://hdl.handle.net/10150/319175.

MLA Handbook (7th Edition):

Mobley, Charles Lee, 1920-. “Matric representation of Boolean algebras .” 1947. Web. 09 Aug 2020.

Vancouver:

Mobley, Charles Lee 1. Matric representation of Boolean algebras . [Internet] [Masters thesis]. University of Arizona; 1947. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/10150/319175.

Council of Science Editors:

Mobley, Charles Lee 1. Matric representation of Boolean algebras . [Masters Thesis]. University of Arizona; 1947. Available from: http://hdl.handle.net/10150/319175


University of British Columbia

10. Klug, Anthony C. Some theory of Boolean valued models .

Degree: 1974, University of British Columbia

Boolean valued structures are defined and some of their properties are studied. Completeness and compactness theorems are proved and Lowenheim-Skolem theorems are looked at. It… (more)

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Klug, A. C. (1974). Some theory of Boolean valued models . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/18793

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Klug, Anthony C. “Some theory of Boolean valued models .” 1974. Thesis, University of British Columbia. Accessed August 09, 2020. http://hdl.handle.net/2429/18793.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Klug, Anthony C. “Some theory of Boolean valued models .” 1974. Web. 09 Aug 2020.

Vancouver:

Klug AC. Some theory of Boolean valued models . [Internet] [Thesis]. University of British Columbia; 1974. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/2429/18793.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Klug AC. Some theory of Boolean valued models . [Thesis]. University of British Columbia; 1974. Available from: http://hdl.handle.net/2429/18793

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of British Columbia

11. Galay, Theodore Alexander. Radical classes of Boolean algebras .

Degree: 1974, University of British Columbia

 This thesis obtains information about Boolean algebras by means of the radical concept. One group of results revolves about the concept, theorems, and constructions of… (more)

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Galay, T. A. (1974). Radical classes of Boolean algebras . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/19509

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Galay, Theodore Alexander. “Radical classes of Boolean algebras .” 1974. Thesis, University of British Columbia. Accessed August 09, 2020. http://hdl.handle.net/2429/19509.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Galay, Theodore Alexander. “Radical classes of Boolean algebras .” 1974. Web. 09 Aug 2020.

Vancouver:

Galay TA. Radical classes of Boolean algebras . [Internet] [Thesis]. University of British Columbia; 1974. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/2429/19509.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Galay TA. Radical classes of Boolean algebras . [Thesis]. University of British Columbia; 1974. Available from: http://hdl.handle.net/2429/19509

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

12. Harvill, John Bowman. Elements of Boolean Algebra Theory.

Degree: 1957, North Texas State College

 The primary purpose of this paper is to state a set of postulates for Boolean algebra and show the characteristic theorems derivable from them, and… (more)

Subjects/Keywords: boolean algebra; Algebra, Boolean.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Harvill, J. B. (1957). Elements of Boolean Algebra Theory. (Thesis). North Texas State College. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc107933/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Harvill, John Bowman. “Elements of Boolean Algebra Theory.” 1957. Thesis, North Texas State College. Accessed August 09, 2020. https://digital.library.unt.edu/ark:/67531/metadc107933/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Harvill, John Bowman. “Elements of Boolean Algebra Theory.” 1957. Web. 09 Aug 2020.

Vancouver:

Harvill JB. Elements of Boolean Algebra Theory. [Internet] [Thesis]. North Texas State College; 1957. [cited 2020 Aug 09]. Available from: https://digital.library.unt.edu/ark:/67531/metadc107933/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harvill JB. Elements of Boolean Algebra Theory. [Thesis]. North Texas State College; 1957. Available from: https://digital.library.unt.edu/ark:/67531/metadc107933/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Montana Tech

13. Walsh, Edward T. Boolean algebras and their topological duals.

Degree: MA, 1966, Montana Tech

Subjects/Keywords: Algebra; Boolean.; Topology.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Walsh, E. T. (1966). Boolean algebras and their topological duals. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/8035

Chicago Manual of Style (16th Edition):

Walsh, Edward T. “Boolean algebras and their topological duals.” 1966. Masters Thesis, Montana Tech. Accessed August 09, 2020. https://scholarworks.umt.edu/etd/8035.

MLA Handbook (7th Edition):

Walsh, Edward T. “Boolean algebras and their topological duals.” 1966. Web. 09 Aug 2020.

Vancouver:

Walsh ET. Boolean algebras and their topological duals. [Internet] [Masters thesis]. Montana Tech; 1966. [cited 2020 Aug 09]. Available from: https://scholarworks.umt.edu/etd/8035.

Council of Science Editors:

Walsh ET. Boolean algebras and their topological duals. [Masters Thesis]. Montana Tech; 1966. Available from: https://scholarworks.umt.edu/etd/8035


University of Oklahoma

14. Teska, John Thomas. A binary representation for finite Boolean functions.

Degree: PhD, 1970, University of Oklahoma

Subjects/Keywords: Mathematics.; Algebra, Boolean.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Teska, J. T. (1970). A binary representation for finite Boolean functions. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/2897

Chicago Manual of Style (16th Edition):

Teska, John Thomas. “A binary representation for finite Boolean functions.” 1970. Doctoral Dissertation, University of Oklahoma. Accessed August 09, 2020. http://hdl.handle.net/11244/2897.

MLA Handbook (7th Edition):

Teska, John Thomas. “A binary representation for finite Boolean functions.” 1970. Web. 09 Aug 2020.

Vancouver:

Teska JT. A binary representation for finite Boolean functions. [Internet] [Doctoral dissertation]. University of Oklahoma; 1970. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/11244/2897.

Council of Science Editors:

Teska JT. A binary representation for finite Boolean functions. [Doctoral Dissertation]. University of Oklahoma; 1970. Available from: http://hdl.handle.net/11244/2897


Columbia University

15. Xie, Jinyu. Property Testing of Boolean Function.

Degree: 2018, Columbia University

 The field of property testing has been studied for decades, and Boolean functions are among the most classical subjects to study in this area. In… (more)

Subjects/Keywords: Computer science; Algebra, Boolean; Distribution (Probability theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xie, J. (2018). Property Testing of Boolean Function. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D86X0TGD

Chicago Manual of Style (16th Edition):

Xie, Jinyu. “Property Testing of Boolean Function.” 2018. Doctoral Dissertation, Columbia University. Accessed August 09, 2020. https://doi.org/10.7916/D86X0TGD.

MLA Handbook (7th Edition):

Xie, Jinyu. “Property Testing of Boolean Function.” 2018. Web. 09 Aug 2020.

Vancouver:

Xie J. Property Testing of Boolean Function. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2020 Aug 09]. Available from: https://doi.org/10.7916/D86X0TGD.

Council of Science Editors:

Xie J. Property Testing of Boolean Function. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D86X0TGD


Rutgers University

16. Gilmer, Justin, 1986-. Discrete local central limit theorems and boolean function complexity measures.

Degree: PhD, Mathematics, 2015, Rutgers University

This thesis consists of 6 chapters (the first being an introduction). Two chapters relate to local central limit theorems, and three chapters relate to various… (more)

Subjects/Keywords: Central limit theorem; Algebra, Boolean; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gilmer, Justin, 1. (2015). Discrete local central limit theorems and boolean function complexity measures. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46347/

Chicago Manual of Style (16th Edition):

Gilmer, Justin, 1986-. “Discrete local central limit theorems and boolean function complexity measures.” 2015. Doctoral Dissertation, Rutgers University. Accessed August 09, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/46347/.

MLA Handbook (7th Edition):

Gilmer, Justin, 1986-. “Discrete local central limit theorems and boolean function complexity measures.” 2015. Web. 09 Aug 2020.

Vancouver:

Gilmer, Justin 1. Discrete local central limit theorems and boolean function complexity measures. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Aug 09]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/.

Council of Science Editors:

Gilmer, Justin 1. Discrete local central limit theorems and boolean function complexity measures. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/

17. Bryant, June Anne. The Structure of a Boolean Algebra.

Degree: 1965, North Texas State University

 The purpose of this chapter is to develop a form of a "free" Boolean algebra with Σ as a base, by imposing the usual Boolean(more)

Subjects/Keywords: Boolean algebra; sigma

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bryant, J. A. (1965). The Structure of a Boolean Algebra. (Thesis). North Texas State University. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc130610/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bryant, June Anne. “The Structure of a Boolean Algebra.” 1965. Thesis, North Texas State University. Accessed August 09, 2020. https://digital.library.unt.edu/ark:/67531/metadc130610/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bryant, June Anne. “The Structure of a Boolean Algebra.” 1965. Web. 09 Aug 2020.

Vancouver:

Bryant JA. The Structure of a Boolean Algebra. [Internet] [Thesis]. North Texas State University; 1965. [cited 2020 Aug 09]. Available from: https://digital.library.unt.edu/ark:/67531/metadc130610/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bryant JA. The Structure of a Boolean Algebra. [Thesis]. North Texas State University; 1965. Available from: https://digital.library.unt.edu/ark:/67531/metadc130610/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Utah State University

18. Eggert, Jr., Norman H. An Investigation of the Range of a Boolean Function.

Degree: MS, Mathematics and Statistics, 1963, Utah State University

  The purpose of this section is to define a boolean algebra and to determine some of the important properties of it. A boolean algebra(more)

Subjects/Keywords: Boolean; boolean algebra; functions; Algebra; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Eggert, Jr., N. H. (1963). An Investigation of the Range of a Boolean Function. (Masters Thesis). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/6772

Chicago Manual of Style (16th Edition):

Eggert, Jr., Norman H. “An Investigation of the Range of a Boolean Function.” 1963. Masters Thesis, Utah State University. Accessed August 09, 2020. https://digitalcommons.usu.edu/etd/6772.

MLA Handbook (7th Edition):

Eggert, Jr., Norman H. “An Investigation of the Range of a Boolean Function.” 1963. Web. 09 Aug 2020.

Vancouver:

Eggert, Jr. NH. An Investigation of the Range of a Boolean Function. [Internet] [Masters thesis]. Utah State University; 1963. [cited 2020 Aug 09]. Available from: https://digitalcommons.usu.edu/etd/6772.

Council of Science Editors:

Eggert, Jr. NH. An Investigation of the Range of a Boolean Function. [Masters Thesis]. Utah State University; 1963. Available from: https://digitalcommons.usu.edu/etd/6772

19. -6678-5678. Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples.

Degree: 2018, Texas A&M International University

 Heindorf and Shapiro studied commuting pairs of Boolean subalgebras and showed that Boolean subalgebra pairs that commute retain their commutativity property after taking the exponential… (more)

Subjects/Keywords: three-way commuting; subalgebra triples; boolean subalgebras; commuting property of boolean subalgebra triples; commuting property of boolean algebras; commuting boolean subalgebras; weakly commuting boolean subalgebra n-tuples; commuting boolean subalgebra n-tuples; exponential functor; Vietoris hyperspace; Stone dual; Stone Representation Theorem; Fields; destroying the commutativity property of finite boolean subalgebra triples; four atom boolean algebra; three atom boolean algebra; atomic boolean algebras; inheriting properties of boolean algebras; atom-wise inheritance of boolean algebra properties; inheriting the commuting property of boolean algebras; Algebra, Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-6678-5678. (2018). Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples. (Thesis). Texas A&M International University. Retrieved from http://hdl.handle.net/2152.4/97

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-6678-5678. “Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples.” 2018. Thesis, Texas A&M International University. Accessed August 09, 2020. http://hdl.handle.net/2152.4/97.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-6678-5678. “Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples.” 2018. Web. 09 Aug 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-6678-5678. Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples. [Internet] [Thesis]. Texas A&M International University; 2018. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/2152.4/97.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-6678-5678. Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples. [Thesis]. Texas A&M International University; 2018. Available from: http://hdl.handle.net/2152.4/97

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

20. Virtanen, Timo. Fault Diagnostics and Vibration Control of Paper Winders.

Degree: 2006, Helsinki University of Technology

A Level-to-Level Minimization (LLM) algorithm based on Boolean algebra was developed and compared to the Quine-McCluskey algorithm based on the manipulation of truth tables of… (more)

Subjects/Keywords: fault diagnostics; vibration control; paper winding; PLC; Boolean algebra; vikadiagnostiikka; tärinän säätö; pituusleikkuri; PLC; Boolean algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Virtanen, T. (2006). Fault Diagnostics and Vibration Control of Paper Winders. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2006/isbn9512284685/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Virtanen, Timo. “Fault Diagnostics and Vibration Control of Paper Winders.” 2006. Thesis, Helsinki University of Technology. Accessed August 09, 2020. http://lib.tkk.fi/Diss/2006/isbn9512284685/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Virtanen, Timo. “Fault Diagnostics and Vibration Control of Paper Winders.” 2006. Web. 09 Aug 2020.

Vancouver:

Virtanen T. Fault Diagnostics and Vibration Control of Paper Winders. [Internet] [Thesis]. Helsinki University of Technology; 2006. [cited 2020 Aug 09]. Available from: http://lib.tkk.fi/Diss/2006/isbn9512284685/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Virtanen T. Fault Diagnostics and Vibration Control of Paper Winders. [Thesis]. Helsinki University of Technology; 2006. Available from: http://lib.tkk.fi/Diss/2006/isbn9512284685/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

21. Niedoba, Pavel. Minimalizace Booleových funkcí pomocí Quineovy-McCluskeyovy metody: Minimalization of Boolean functions by means of Quine-McCluskey's method.

Degree: 2019, Brno University of Technology

 This work is concerned with minimalization of Boolean functions by means of Quine-McCluskey´s method with application of the method of prime implicants for obtaining the… (more)

Subjects/Keywords: Quineova-McCluskeyova metoda; minimalizace; Booleova algebra; Booleovy funkce; Quine-McCluskey´s method; minimalization; Boolean algebra; Boolean functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Niedoba, P. (2019). Minimalizace Booleových funkcí pomocí Quineovy-McCluskeyovy metody: Minimalization of Boolean functions by means of Quine-McCluskey's method. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/18736

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Niedoba, Pavel. “Minimalizace Booleových funkcí pomocí Quineovy-McCluskeyovy metody: Minimalization of Boolean functions by means of Quine-McCluskey's method.” 2019. Thesis, Brno University of Technology. Accessed August 09, 2020. http://hdl.handle.net/11012/18736.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Niedoba, Pavel. “Minimalizace Booleových funkcí pomocí Quineovy-McCluskeyovy metody: Minimalization of Boolean functions by means of Quine-McCluskey's method.” 2019. Web. 09 Aug 2020.

Vancouver:

Niedoba P. Minimalizace Booleových funkcí pomocí Quineovy-McCluskeyovy metody: Minimalization of Boolean functions by means of Quine-McCluskey's method. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/11012/18736.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Niedoba P. Minimalizace Booleových funkcí pomocí Quineovy-McCluskeyovy metody: Minimalization of Boolean functions by means of Quine-McCluskey's method. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/18736

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. Alznad, Nawal. T-de Vries Algebra.

Degree: PhD, Mathematics, 2018, U of Denver

  The main point of this dissertation is to introduce the action on de Vries algebra by a topological monoid and we denoted the resulting… (more)

Subjects/Keywords: Boolean Algebra; de Vries algebra; Flow; Monoid action; Proximity; Mathematics; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Alznad, N. (2018). T-de Vries Algebra. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1488

Chicago Manual of Style (16th Edition):

Alznad, Nawal. “T-de Vries Algebra.” 2018. Doctoral Dissertation, U of Denver. Accessed August 09, 2020. https://digitalcommons.du.edu/etd/1488.

MLA Handbook (7th Edition):

Alznad, Nawal. “T-de Vries Algebra.” 2018. Web. 09 Aug 2020.

Vancouver:

Alznad N. T-de Vries Algebra. [Internet] [Doctoral dissertation]. U of Denver; 2018. [cited 2020 Aug 09]. Available from: https://digitalcommons.du.edu/etd/1488.

Council of Science Editors:

Alznad N. T-de Vries Algebra. [Doctoral Dissertation]. U of Denver; 2018. Available from: https://digitalcommons.du.edu/etd/1488


Hong Kong University of Science and Technology

23. Wong, Mei Ling. Lattices and Bß-algebras.

Degree: 2000, Hong Kong University of Science and Technology

 A ring over the Boolean algebra B1 (which we call B1-algebra), has both combinatorial and algebraic features. A finite module over B1 has naturally a… (more)

Subjects/Keywords: Lattice theory ; Algebra, Boolean ; Rings (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wong, M. L. (2000). Lattices and Bß-algebras. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5106 ; https://doi.org/10.14711/thesis-b688790 ; http://repository.ust.hk/ir/bitstream/1783.1-5106/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wong, Mei Ling. “Lattices and Bß-algebras.” 2000. Thesis, Hong Kong University of Science and Technology. Accessed August 09, 2020. http://repository.ust.hk/ir/Record/1783.1-5106 ; https://doi.org/10.14711/thesis-b688790 ; http://repository.ust.hk/ir/bitstream/1783.1-5106/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wong, Mei Ling. “Lattices and Bß-algebras.” 2000. Web. 09 Aug 2020.

Vancouver:

Wong ML. Lattices and Bß-algebras. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2000. [cited 2020 Aug 09]. Available from: http://repository.ust.hk/ir/Record/1783.1-5106 ; https://doi.org/10.14711/thesis-b688790 ; http://repository.ust.hk/ir/bitstream/1783.1-5106/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wong ML. Lattices and Bß-algebras. [Thesis]. Hong Kong University of Science and Technology; 2000. Available from: http://repository.ust.hk/ir/Record/1783.1-5106 ; https://doi.org/10.14711/thesis-b688790 ; http://repository.ust.hk/ir/bitstream/1783.1-5106/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Montana State University

24. Berges, George Albert. Heuristic interactive synthesis of cellular arrays : based on Polish notation.

Degree: College of Engineering, 1970, Montana State University

Subjects/Keywords: Algebra, Boolean.; Switching theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Berges, G. A. (1970). Heuristic interactive synthesis of cellular arrays : based on Polish notation. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/3978

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Berges, George Albert. “Heuristic interactive synthesis of cellular arrays : based on Polish notation.” 1970. Thesis, Montana State University. Accessed August 09, 2020. https://scholarworks.montana.edu/xmlui/handle/1/3978.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Berges, George Albert. “Heuristic interactive synthesis of cellular arrays : based on Polish notation.” 1970. Web. 09 Aug 2020.

Vancouver:

Berges GA. Heuristic interactive synthesis of cellular arrays : based on Polish notation. [Internet] [Thesis]. Montana State University; 1970. [cited 2020 Aug 09]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/3978.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Berges GA. Heuristic interactive synthesis of cellular arrays : based on Polish notation. [Thesis]. Montana State University; 1970. Available from: https://scholarworks.montana.edu/xmlui/handle/1/3978

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Johannesburg

25. Pienaar, Martin Izak. Representation theorems in universal algebra and algebraic logic.

Degree: 2012, University of Johannesburg

M.Sc.

Subjects/Keywords: Algebraic logic; Algebra, Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pienaar, M. I. (2012). Representation theorems in universal algebra and algebraic logic. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6785

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pienaar, Martin Izak. “Representation theorems in universal algebra and algebraic logic.” 2012. Thesis, University of Johannesburg. Accessed August 09, 2020. http://hdl.handle.net/10210/6785.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pienaar, Martin Izak. “Representation theorems in universal algebra and algebraic logic.” 2012. Web. 09 Aug 2020.

Vancouver:

Pienaar MI. Representation theorems in universal algebra and algebraic logic. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Aug 09]. Available from: http://hdl.handle.net/10210/6785.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pienaar MI. Representation theorems in universal algebra and algebraic logic. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6785

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Montana Tech

26. Kem, Margaret Alice. Schroder-Bernstein theorem in various algebraic systems.

Degree: MA, 1966, Montana Tech

Subjects/Keywords: Algebra; Boolean.; Abelian groups.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kem, M. A. (1966). Schroder-Bernstein theorem in various algebraic systems. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/8036

Chicago Manual of Style (16th Edition):

Kem, Margaret Alice. “Schroder-Bernstein theorem in various algebraic systems.” 1966. Masters Thesis, Montana Tech. Accessed August 09, 2020. https://scholarworks.umt.edu/etd/8036.

MLA Handbook (7th Edition):

Kem, Margaret Alice. “Schroder-Bernstein theorem in various algebraic systems.” 1966. Web. 09 Aug 2020.

Vancouver:

Kem MA. Schroder-Bernstein theorem in various algebraic systems. [Internet] [Masters thesis]. Montana Tech; 1966. [cited 2020 Aug 09]. Available from: https://scholarworks.umt.edu/etd/8036.

Council of Science Editors:

Kem MA. Schroder-Bernstein theorem in various algebraic systems. [Masters Thesis]. Montana Tech; 1966. Available from: https://scholarworks.umt.edu/etd/8036


Univerzitet u Beogradu

27. Marovac, Ulfeta A., 1980-. Истраживање образаца у одређивању карактеристика протеина.

Degree: Matematički fakultet, 2016, Univerzitet u Beogradu

Рачунарство - Истраживање података / Computer science - Data mining

Беланчевине или протеини су важни биолошки макромолекули полимерне природе (полипептиди), који се састоје од амино киселина и представљају основну градивну јединицу сваке ћелије...

Advisors/Committee Members: Mitić, Nenad, 1959-.

Subjects/Keywords: characteristics of proteins; classication; mining sequential patterns; n-gram; Boolean algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Marovac, Ulfeta A., 1. (2016). Истраживање образаца у одређивању карактеристика протеина. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:11546/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Marovac, Ulfeta A., 1980-. “Истраживање образаца у одређивању карактеристика протеина.” 2016. Thesis, Univerzitet u Beogradu. Accessed August 09, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:11546/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Marovac, Ulfeta A., 1980-. “Истраживање образаца у одређивању карактеристика протеина.” 2016. Web. 09 Aug 2020.

Vancouver:

Marovac, Ulfeta A. 1. Истраживање образаца у одређивању карактеристика протеина. [Internet] [Thesis]. Univerzitet u Beogradu; 2016. [cited 2020 Aug 09]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:11546/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Marovac, Ulfeta A. 1. Истраживање образаца у одређивању карактеристика протеина. [Thesis]. Univerzitet u Beogradu; 2016. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:11546/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Columbia University

28. Kowalczyk, Lucas. Attribute-Based Encryption for Boolean Formulas.

Degree: 2019, Columbia University

 We present attribute-based encryption (ABE) schemes for Boolean formulas that are adaptively secure under simple assumptions. Notably, our KP-ABE scheme enjoys a ciphertext size that… (more)

Subjects/Keywords: Computer science; Data encryption (Computer science); Algebra, Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kowalczyk, L. (2019). Attribute-Based Encryption for Boolean Formulas. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/d8-212y-yy33

Chicago Manual of Style (16th Edition):

Kowalczyk, Lucas. “Attribute-Based Encryption for Boolean Formulas.” 2019. Doctoral Dissertation, Columbia University. Accessed August 09, 2020. https://doi.org/10.7916/d8-212y-yy33.

MLA Handbook (7th Edition):

Kowalczyk, Lucas. “Attribute-Based Encryption for Boolean Formulas.” 2019. Web. 09 Aug 2020.

Vancouver:

Kowalczyk L. Attribute-Based Encryption for Boolean Formulas. [Internet] [Doctoral dissertation]. Columbia University; 2019. [cited 2020 Aug 09]. Available from: https://doi.org/10.7916/d8-212y-yy33.

Council of Science Editors:

Kowalczyk L. Attribute-Based Encryption for Boolean Formulas. [Doctoral Dissertation]. Columbia University; 2019. Available from: https://doi.org/10.7916/d8-212y-yy33


University of Colorado

29. Chestnut, Robin Michael. Independent Partitions in Boolean Algebras.

Degree: PhD, Mathematics, 2012, University of Colorado

  This dissertation introduces a generalization of the cardinal invariant independence for Boolean algebras, suggested by the proof of the Balcar-Franek Theorem. The objects of… (more)

Subjects/Keywords: Boolean Algebra; Independence; Logic; Partition; Set Theory; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chestnut, R. M. (2012). Independent Partitions in Boolean Algebras. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/12

Chicago Manual of Style (16th Edition):

Chestnut, Robin Michael. “Independent Partitions in Boolean Algebras.” 2012. Doctoral Dissertation, University of Colorado. Accessed August 09, 2020. https://scholar.colorado.edu/math_gradetds/12.

MLA Handbook (7th Edition):

Chestnut, Robin Michael. “Independent Partitions in Boolean Algebras.” 2012. Web. 09 Aug 2020.

Vancouver:

Chestnut RM. Independent Partitions in Boolean Algebras. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2020 Aug 09]. Available from: https://scholar.colorado.edu/math_gradetds/12.

Council of Science Editors:

Chestnut RM. Independent Partitions in Boolean Algebras. [Doctoral Dissertation]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/math_gradetds/12


California State University – San Bernardino

30. Schardijn, Amy. AN INTRODUCTION TO BOOLEAN ALGEBRAS.

Degree: MAin Mathematics, Mathematics, 2016, California State University – San Bernardino

  This thesis discusses the topic of Boolean algebras. In order to build intuitive understanding of the topic, research began with the investigation of Boolean(more)

Subjects/Keywords: boolean; algebras; set theory; boole; lattice; ultrafilter; Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schardijn, A. (2016). AN INTRODUCTION TO BOOLEAN ALGEBRAS. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/421

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Schardijn, Amy. “AN INTRODUCTION TO BOOLEAN ALGEBRAS.” 2016. Thesis, California State University – San Bernardino. Accessed August 09, 2020. https://scholarworks.lib.csusb.edu/etd/421.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Schardijn, Amy. “AN INTRODUCTION TO BOOLEAN ALGEBRAS.” 2016. Web. 09 Aug 2020.

Vancouver:

Schardijn A. AN INTRODUCTION TO BOOLEAN ALGEBRAS. [Internet] [Thesis]. California State University – San Bernardino; 2016. [cited 2020 Aug 09]. Available from: https://scholarworks.lib.csusb.edu/etd/421.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schardijn A. AN INTRODUCTION TO BOOLEAN ALGEBRAS. [Thesis]. California State University – San Bernardino; 2016. Available from: https://scholarworks.lib.csusb.edu/etd/421

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4]

.