Search alternatives:
proving infinite » proving infinitude, proving definite, proving finite
using infinite » using finite, solving infinite
Cover Image
Read Now

61
Published 1994
Springer Berlin Heidelberg
Table of Contents: “... in polynomial expected time -- Finite-state strategies in regular infinite games -- Location of the largest...”
Cover Image
Read Now

62
by Heydenreich, Markus, van der Hofstad, Remco
Published 2017
Springer International Publishing
Table of Contents: “.... Further critical exponents -- 12. Kesten's incipient infinite cluster -- 13. Finite-size scaling...”
Cover Image
Read Now

63
by Conway, John H., Guy, Richard
Published 1996
Springer New York
Table of Contents: “... Transcendental Numbers -- 10 Infinite and Infinitesimal Numbers...”
Cover Image
Read Now

64
Published 2009
Springer Berlin Heidelberg
Table of Contents: “... Be Proved Correct? -- Probabilistic Acceptors for Languages over Infinite Words -- Automatic Verification...”
Cover Image
Read Now

65
Published 1990
Springer Berlin Heidelberg
Table of Contents: “...Reasoning about linear constraints using parametric queries -- Discriminant circumscription...”
Cover Image
Read Now

66
Published 2008
Springer Berlin Heidelberg
Table of Contents: “...: Using Semantic Web Technologies to Enrich User Interaction with the Web and Vice Versa...”
Cover Image
Read Now

67
by Ellis, Richard.S.
Published 1985
Springer New York
Table of Contents: “.... Proof of Theorem II.7.2 -- Appendix C: Equivalent Notions of Infinite-Volume Measures for Spin Systems...”
Cover Image
Read Now

68
Published 1996
Springer Berlin Heidelberg
Table of Contents: “... supporting the construction of cTLA-Specifications -- A tool for proving invariance properties of concurrent...”
Cover Image
Read Now

69
by Bajnok, Béla
Published 2020
Springer International Publishing
Table of Contents: “... of Set Theory -- III How to Prove It -- 9 Universal Proofs -- 10 The Domino Theory -- 11 More Domino...”
Cover Image
Read Now

70
Published 2007
Springer Berlin Heidelberg
Table of Contents: “...-Checking Based on Random Cryptographic Constructions -- Session XII: Abstraction -- Using Counterexamples...”
Cover Image
Read Now

71
Published 2008
Springer Berlin Heidelberg
Table of Contents: “... -- Functional-Logic Graph Parser Combinators -- Proving Quadratic Derivational Complexities Using Context...”
Cover Image
Read Now

72
by Peters, Steef
Published 2022
IntechOpen
“... how to apply the model. In Volume 3, we use experimental data to prove the reliability of the model...”
Cover Image
Read Now

73
Published 1977
Springer Berlin Heidelberg
Table of Contents: “...Methodology of proving a finite-state stochastic representability and nonrepresentability -- Non...”
Cover Image
Read Now

74
by Reich, Simeon, Zaslavski, Alexander J.
Published 2014
Springer New York
Table of Contents: “... Operators with Respect to Bregman Distances.- 6. Infinite Products -- 7. Best Approximation -- 8. Descent...”
Cover Image
Read Now

75
Published 2006
Springer Berlin Heidelberg
Table of Contents: “... Approach to Determinisation Using Bit-Parallelism -- Logic and Type Theory -- Proving ATL* Properties...”
Cover Image
Read Now

76
Published 1995
Springer Berlin Heidelberg
Table of Contents: “... computation -- Order-sorted algebraic specifications with higher-order functions -- Proving the correctness...”
Cover Image
Read Now

77
Published 2008
Springer Berlin Heidelberg
Table of Contents: “...- and Satisfiability-Checking on Bi-infinite Time -- Formal Analysis of Workflows Using UML 2.0 Activities and Graph...”
Cover Image
Read Now

78
by Gerstein, Larry J.
Published 2012
Springer New York
Table of Contents: “.... Functions -- 4. Finite and Infinite Sets -- 5. Combinatorics -- 6. Number Theory -- 7. Complex Numbers...”
Cover Image
Read Now

79 Table of Contents: “... specifications -- 26 Using a formal description technique to model aspects of a global air traffic...”
Cover Image
Read Now

80
Published 1995
Springer Berlin Heidelberg
Table of Contents: “... -- Verifying parameterized networks using abstraction and regular languages -- On the complexity of branching...”