EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Pseudopolynomial algorithms"
Narrow search

Narrow search

Year of publication
Subject
All
Computational complexity 1 Inapproximability 1 Interval data 1 NP-hardness 1 Pseudopolynomial algorithms 1 t-ratio 1
Online availability
All
Undetermined 1
Type of publication
All
Article 1
Language
All
Undetermined 1
Author
All
Hladík, Milan 1 Černý, Michal 1
Published in...
All
Computational Statistics & Data Analysis 1
Source
All
RePEc 1
Showing 1 - 1 of 1
Cover Image
The complexity of computation and approximation of the t-ratio over one-dimensional interval data
Černý, Michal; Hladík, Milan - In: Computational Statistics & Data Analysis 80 (2014) C, pp. 26-43
The main question is how to compute the upper and lower limits of the range of possible values of a given statistic, when the data range over given intervals. Initially some well-known statistics, such as sample mean, sample variance or F-ratio, are considered in order to illustrate that in some...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011056488
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...