Skip to content

Issues: rihardsk/query_alg

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

17 Open 11 Closed
17 Open 11 Closed
Author
Filter by author
Loading
Label
Filter by label
Loading
Use alt + click/return to exclude labels
or ⇧ + click/return for logical OR
Projects
Filter by project
Loading
Milestones
Filter by milestone
Loading
Assignee
Filter by who’s assigned
Sort
Sort by
Newest Oldest Most commented Least commented Recently updated Least recently updated Best match
Most reactions
👍 👎 😄 🎉 😕 ❤️ 🚀 👀

Issues list

proof of Theorem 1: Shouldn't the threshold be p, instead of 1? clarification new
#24 opened Oct 25, 2013 by rihardsk
Theorem 1: Why does the Theorem not announce that there exists an algorithm of complexity 1? I understand that the complexity-1 algorithm of Fig.4 is applicable here as well. Please explain why you opted for the weaker statement. clarification new
#23 opened Oct 25, 2013 by rihardsk
proof of Theorem 1: Why do you not use here the complexity-2 algorithm of Fig.1? ... clarification enhancement new
#22 opened Oct 25, 2013 by rihardsk
page 6, line -1: Please use the standard name for a permutation of this kind, i.e., say that it is an "automorphism" of G. Please also call it y, so we know what y_i and y_j are later on. clarification new
#19 opened Oct 25, 2013 by rihardsk
I'm highly missing the motivation for such a computation model - some argumentation that it is realistic. enhancement
#13 opened Feb 21, 2013 by rihardsk
The paper would benefit from more clear presentation. In example, although mentioned in the text, it would be nice to stress even more that rational numbers correspond to p-adic numbers with infinite number of non-zero elements, etc. enhancement
#12 opened Feb 21, 2013 by rihardsk
On page 7, the last "\cases" is typeset in a wrong way. syntax
#11 opened Feb 21, 2013 by rihardsk
On page 7, you speak about "preserving a graph", but the standard term is "automorphism". enhancement
#10 opened Feb 21, 2013 by rihardsk
On page 5, why do you speak about "finite geometries" when you actually work with graphs? clarification enhancement
#9 opened Feb 21, 2013 by rihardsk
In Sec 3, what does mean to "make a query"? One can guess that you mean reading one bit, but one could also speculate about other meanings, like to compare two bits, or to make a general propositional query. So, this SHOULD be defined. definition missing
#8 opened Feb 21, 2013 by rihardsk
In Sec 2.2, why do you define a "metric" when you then only use a "norm"? enhancement
#7 opened Feb 21, 2013 by rihardsk
On the model in general.. enhancement
#6 opened Feb 21, 2013 by rihardsk
Paper does not give a definition of this model definition missing
#5 opened Feb 21, 2013 by rihardsk
Section 2.2 do not seem to make sense. enhancement
#4 opened Feb 21, 2013 by rihardsk
The model itself is also not clear. definition missing
#3 opened Feb 21, 2013 by rihardsk
In Figure 2, what does the notation "0,(0,0)" mean? definition missing
#2 opened Feb 21, 2013 by rihardsk
In Figure 1, what does epsilon,1 mean? Why do some nodes have two edges leaving them -- what does this mean? definition missing
#1 opened Feb 21, 2013 by rihardsk
ProTip! Adding no:label will show everything without a label.