Network profile

Antonio Valerio Miceli-Barone

Reputation

2,001

2k
1.8k
1.6k

2017
2018
2019
2020

Top tag

machine-learning

Next privilege

2,500 Rep.

Create tag synonyms

Badges

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

117 votes cast

12 Questions

Votes Activity Newest Views

votes

answers

views

How many instances of 3-SAT are satisfiable?

cc.complexity-theory sat

Mar 30 '11 at 1:17 Hsien-Chih Chang 張顯之 7,398

votes

answer

517

views

Energy considerations on computation

cc.complexity-theory big-picture physics

Jun 3 '11 at 17:55 Community♦ 1

votes

answer

views

Clifford group quantum operations and classical computation

quantum-computing

Sep 11 '12 at 0:00 Tyson Williams 4,218

votes

answer

238

views

Dependent corrections in measurement-based Universal Blind Quantum Computation

quantum-computing cr.crypto-security

Nov 10 '10 at 5:42 Joe Fitzsimons 13.2k

votes

answers

420

views

Efficient algorithms for searching a collection of trees

graph-algorithms ds.data-structures tree graph-isomorphism string-search

Oct 7 '14 at 23:39 Chad Brewbaker 2,307

votes

answers

333

views

Approximation of Quantum Channels

quantum-computing it.information-theory quantum-information

May 7 '12 at 14:31 Community♦ 1

votes

answers

354

views

Energy cost of adiabatic quantum computation

quantum-computing physics

Oct 26 '10 at 1:14 Artem Kaznatcheev♦ 9,923

votes

answers

639

views

Isolation in Turing-complete reversible cellular automata

computability physics cellular-automata

Nov 22 '18 at 15:43 4xel 1

votes

answers

183

views

Complexity of the Transductive SVM training problem

cc.complexity-theory reference-request machine-learning svm

Feb 24 '14 at 23:51 Niel de Beaudrap 8,649

votes

answer

250

views

Quantum Channel Decoding

reference-request quantum-computing it.information-theory quantum-information

May 7 '12 at 14:32 Juan Bermejo Vega 1,345

votes

answer

218

views

State transducers for generating permutations

co.combinatorics automata-theory

Oct 24 '12 at 4:48 Yuval Filmus 14k

votes

answer

233

views

Terminology for types of universal computation

reference-request computability turing-machines terminology universal-computation

Apr 26 '11 at 4:07 Kaveh 20.9k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

12 Questions

How many instances of 3-SAT are satisfiable?

Energy considerations on computation

Clifford group quantum operations and classical computation

Dependent corrections in measurement-based Universal Blind Quantum Computation

Efficient algorithms for searching a collection of trees

Approximation of Quantum Channels

Energy cost of adiabatic quantum computation

Isolation in Turing-complete reversible cellular automata

Complexity of the Transductive SVM training problem

Quantum Channel Decoding

State transducers for generating permutations

Terminology for types of universal computation