activity
20002016
most citedP is not equal to NP intersect coNP for Infinite Time Turing Machines

2 citations · 4 across the 7 of their papers we have counts for

collaborators

7 papers

cs.DB2016★ 1 cited

Extensive Large-Scale Study of Error in Samping-Based Distinct Value Estimators for Databases

Vinay Deolalikar, Hernan Laffitte

The problem of distinct value estimation has many applications. Being a critical component of query optimizers in databases, it also has high commercial impact. Many distinct value…

math.LO2003★ 2 cited

P is not equal to NP intersect coNP for Infinite Time Turing Machines

Vinay Deolalikar, Joel David Hamkins, Ralf-Dieter Schindler

Extending results of Schindler [math.LO/0106087] and Hamkins and Welch [math.LO/0212046], we establish in the context of infinite time Turing machines that P is properly contained…

math.LO2003

On the questions P ?= NP co-NP and NP ?= co-NP for infinite time Turing machines

Vinay Deolalikar

Schindler recently addressed two versions of the question P NP for Turing machines running in transfinite ordinal time. These versions differ in their definition…

math.NT2000

Fields, towers of function fields meeting asymptotic bounds, and basis constructions for algebraic-geometric codes

Vinay Deolalikar

In this work, we use the notion of ``symmetry'' of functions for an extension of finite fields to produce extensions of a function field in which almost all places of d…

math.NT2000

Towers of function fields with extremal properties

Vinay Deolalikar

Certain towers of function fields with complete splitting of rational places at each stage are constructed. Also, families oof towers with positive N/g ratios are described.

math.NT2000

Extensions of algebraic function fields with complete splitting of all rational places

Vinay Deolalikar

We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over fi…