AI Chat AI Image Generator AI Video Text to Speech

A note on time hierarchies for reasonable semantic classes without advice

11/29/2017

∙

by Hao Wu, et al.

∙

∙

We show time hierarchies for reasonable semantic classes without advice by eliminating the constant bits of advice in previous results.The elimination is done by a contrapositive argument that for any reasonable computational model,let CTIME(f(n))/g(n) denote the set of all languages decide by machines running in time O(f(n)) with advice of g(n) bits in that model, if CTIME(t(n))⊆CTIME(T(n))/A(n) then CTIME(t(n))/a ⊆CTIME(T(n))/a+2^aA(n) where a is a constant integer.

research

∙ 07/01/2023

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard

Let d be a positive integer. For a finite set X ⊆ℝ^d, we define its inte...

0 Łukasz Kowalik, et al. ∙

research

∙ 07/23/2018

Two Algorithms to Find Primes in Patterns

Let k> 1 be an integer, and let (f_1(x), ..., f_k(x) ) be k admissible l...

0 Jonathan P. Sorenson, et al. ∙

research

∙ 01/27/2001

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

Let G be an embedded planar undirected graph that has n vertices, m edge...

0 Xin He, et al. ∙

research

∙ 10/05/2022

Faster parameterized algorithms for modification problems to minor-closed classes

Let G be a minor-closed graph class and let G be an n-vertex graph. We s...

0 Laure Morelle, et al. ∙

research

∙ 09/29/2017

Recognizing Matroids

Let E be a finite set and P, S, L three classes of subsets of E, and ...

1 Brahim Chaourar, et al. ∙

research

∙ 02/09/2021

Constant Approximating k-Clique is W[1]-hard

For every graph G, let ω(G) be the largest size of complete subgraph in ...

0 Bingkai Lin, et al. ∙

research

∙ 06/15/2023

Easier Estimation of Extremes under Randomized Response

In this brief note, we consider estimation of the bitwise combination x_...

0 Jonathan Hehir, et al. ∙