#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1999

2018

- This year (3)
- Last 5 years (18)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We introduce the notion of Boolean programs, which provide more concise descriptions of Boolean functions than Boolean circuits. We characterize nonuniform PSPACE in terms of polynomial size familiesâ€¦ (More)

- Cassie Wagner, Meseret D. Gebremichael, Mary Kay Taylor, Michael Soltys
- Journal of the Medical Library Association : JMLA
- 2009

OBJECTIVES
This study examines the problem of decay of uniform resource locators (URLs) in health care management journals and seeks to determine whether continued availability at a given URL relatesâ€¦ (More)

- Michael Soltys, Stephen A. Cook
- Ann. Pure Appl. Logic
- 2004

We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We give what isâ€¦ (More)

- Neil Thapen, Michael Soltys
- Arch. Math. Log.
- 2005

We investigate the theories LA,LAP,âˆ€LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize Frege proofs. We give sentencesâ€¦ (More)

- Waldemar W. Koczkodaj, Ludmil Mikhailov, +5 authors Kevin Kam Fung Yuen
- Fundam. Inform.
- 2016

- Waldemar W. Koczkodaj, Jean-Pierre Magnot, +6 authors Arturo Tozzi
- Int. J. Approx. Reasoning
- 2017

In this study, we provide mathematical and practice-driven justification for using [0,1] normalization of inconsistency indicators in pairwise comparisons. The need for normalization, as well asâ€¦ (More)

- Michael Soltys
- 2002

A combinatorial interpretation of Berkowitzâ€™s algorithm is presented. Berkowitzâ€™s algorithm is the fastest known parallel algorithm for computing the characteristic polynomial of a matrix. Theâ€¦ (More)

- Neerja Mhaskar, Michael Soltys
- WALCOM
- 2015

A word is non-repetitive if it does not contain a subword of the form vv. Given a list of alphabets L = L1, L2, . . . , Ln, we investigate the question of generating non-repetitive words w = w1w2 . .â€¦ (More)

- Joel Helling, P. J. Ryan, William F. Smyth, Michael Soltys
- Theor. Comput. Sci.
- 2018

Article history: Received 21 May 2016 Received in revised form 2 February 2017 Accepted 14 February 2017 Available online xxxx

We show that the well-known KÃ¶nigâ€™s Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory LA with induction restricted to Î£1 formulas.â€¦ (More)